José M. P. Paixão

According to our database, José M. P. Paixão authored at least 8 papers between 1993 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

A look at the past and present of optimization - An editorial.

Silvano Martello, José M. P. Paixão

Eur. J. Oper. Res., 2012

2010

An approximate solution approach for a scenario-based capital budgeting model.

Anabela Costa, José M. P. Paixão

Comput. Manag. Sci., 2010

2009

Driver scheduling problem modelling.

Rita Portugal, Helena R. Lourenço, José M. P. Paixão

Public Transp., 2009

2003

The determination of the path with minimum-cost norm value.

José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Dos Santos

Networks, 2003

2001

Multiobjective Metaheuristics for the Bus Driver Scheduling Problem.

Helena R. Lourenço, José M. P. Paixão, Rita Portugal

Transp. Sci., 2001

Models and Algorithms for Single-Depot Vehicle Scheduling.

Richard Freling, Albert P. M. Wagelmans, José M. P. Paixão

Transp. Sci., 2001

1996

An Investigation of Interior-Point Algorithms for the Linear Transportation Problem.

Luis F. Portugal, Frederico Machado Bastos, Joaquim Júdice, José M. P. Paixão, Tamás Terlaky

SIAM J. Sci. Comput., 1996

1993

Algorithms for large scale set covering problems.

Nicos Christofides, José M. P. Paixão

Ann. Oper. Res., 1993