M. Eugénia V. Captivo

Orcid: 0000-0003-4963-244X

Affiliations:
  • Universidade de Lisboa, Portugal


According to our database1, M. Eugénia V. Captivo authored at least 29 papers between 2003 and 2020.

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

2020
Integrating the ambulance dispatching and relocation problems to maximize system's preparedness.
Eur. J. Oper. Res., 2020

2017
Different stakeholders' perspectives for a surgical case assignment problem: Deterministic and robust approaches.
Eur. J. Oper. Res., 2017

2016
Weight distribution in container loading: a case study.
Int. Trans. Oper. Res., 2016

2014
A DSS for bicriteria location problems.
Decis. Support Syst., 2014

A Discussion on the Role of Decision Support in a Location Analysis Case Study.
Proceedings of the DSS 2.0, 2014

2013
Bicriteria path problem minimizing the cost and minimizing the number of labels.
4OR, 2013

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

A multi-attribute analysis module for SABILOC - a DSS for Location Problems.
Proceedings of the Fusing Decision Support Systems into the Fabric of the Context, 2012

2010
On the bicriterion - minimal cost/minimal label - spanning tree problem.
Eur. J. Oper. Res., 2010

A GIS embedded decision support system for bicriteria location problems.
Proceedings of the Bridging the Socio-technical Gap in Decision Support Systems, 2010

2009
A mixed integer linear formulation for the minimum label spanning tree problem.
Comput. Oper. Res., 2009

2008
A memetic algorithm for multi-objective dynamic location problems.
J. Glob. Optim., 2008

Marketing-production Interface through an Integrated DSS.
J. Decis. Syst., 2008

On Multicriteria Mixed Integer Linear Programming Based Tools for Location Problems-An Updated Critical Overview Illustrated with a Bicriteria DSS.
Computación y Sistemas, 2008

Capacitated single allocation hub location problem - A bi-criteria approach.
Comput. Oper. Res., 2008

A dynamic location problem with maximum decreasing capacities.
Central Eur. J. Oper. Res., 2008

2007
Dynamic multi-level capacitated and uncapacitated location problems: an approach using primal-dual heuristics.
Oper. Res., 2007

Internet packet routing: Application of a K.
Eur. J. Oper. Res., 2007

Efficient primal-dual heuristic for a dynamic location problem.
Comput. Oper. Res., 2007

A Memetic Algorithm for Dynamic Location Problems.
Proceedings of the Metaheuristics, 2007

2006
Bounds for the single source modular capacitated plant location problem.
Comput. Oper. Res., 2006

A comprehensive survey on the quickest path problem.
Ann. Oper. Res., 2006

2005
An algorithm for ranking quickest simple paths.
Comput. Oper. Res., 2005

2004
Erratum to "An interactive procedure dedicated to a bicriteria plant location model": [Computers & Operations Research 30 (2003) 1977-2002].
Comput. Oper. Res., 2004

2003
Upper and lower bounds for the single source capacitated location problem.
Eur. J. Oper. Res., 2003

An interactive procedure dedicated to a bicriteria plant location model.
Comput. Oper. Res., 2003

Solving bicriteria 0-1 knapsack problems using a labeling algorithm.
Comput. Oper. Res., 2003

A Lagrangean Heuristic for a Modular Capacitated Location Problem.
Ann. Oper. Res., 2003

A note on a new variant of Murty's ranking assignments algorithm.
4OR, 2003


  Loading...