Margarida Vaz Pato

Orcid: 0000-0003-2277-5918

According to our database1, Margarida Vaz Pato authored at least 31 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Correction to: An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems.
Ann. Oper. Res., January, 2024

2022
Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation.
Ann. Oper. Res., 2022

2021
A network flow-based algorithm for bus driver rerostering.
OR Spectr., 2021

A bi-objective mathematical model for integrated planning of sugarcane harvesting and transport operations.
Comput. Oper. Res., 2021

An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems.
Ann. Oper. Res., 2021

2018
A computational application for multi-skill nurse staffing in hospital units.
BMC Medical Informatics Decis. Mak., 2018

A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem.
J. Oper. Res. Soc., 2018

2017
Modeling the Steering of International Roaming Traffic.
Eur. J. Oper. Res., 2017

2015
A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern.
Eur. J. Oper. Res., 2015

2014
A bi-objective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements.
J. Oper. Res. Soc., 2014

Metaheuristics for a crop rotation problem.
Int. J. Metaheuristics, 2014

An improved decomposition-based heuristic to design a water distribution network for an irrigation system.
Ann. Oper. Res., 2014

2013
Enhanced genetic algorithms for a bi-objective bus driver rostering problem: a computational study.
Int. Trans. Oper. Res., 2013

A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern.
Eur. J. Oper. Res., 2013

2012
An integer programming approach to elective surgery scheduling.
OR Spectr., 2012

Planning Bus Driver Rosters.
Proceedings of the ICORES 2012, 2012

A Genetic Algorithm for Crop Rotation.
Proceedings of the ICORES 2012, 2012

2011
A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters.
J. Sched., 2011

A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem.
Comput. Math. Appl., 2011

2010
An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern.
Proceedings of the Operations Research Proceedings 2010, 2010

2009
Bi-objective evolutionary heuristics for bus driver rostering.
Public Transp., 2009

2008
Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic.
J. Heuristics, 2008

2007
The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem.
Eur. J. Oper. Res., 2007

A genetic algorithm approach to a nurse rerostering problem.
Comput. Oper. Res., 2007

2004
A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
Eur. J. Oper. Res., 2004

An improved genetic heuristic to support the design of flexible manufacturing systems.
Comput. Ind. Eng., 2004

Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models.
Ann. Oper. Res., 2004

2003
An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules.
Ann. Oper. Res., 2003

2000
A three-phase procedure for designing an irrigation system's water distribution network.
Ann. Oper. Res., 2000

A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem.
Proceedings of the Practice and Theory of Automated Timetabling III, 2000

1998
Search strategies for the feeder bus network design problem.
Eur. J. Oper. Res., 1998


  Loading...