default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Eugénia V. Captivo
Person information
- affiliation: Universidade de Lisboa, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j25]A. S. Carvalho, Maria Eugénia V. Captivo
, Inês Marques:
Integrating the ambulance dispatching and relocation problems to maximize system's preparedness. Eur. J. Oper. Res. 283(3): 1064-1080 (2020)
2010 – 2019
- 2017
- [j24]Inês Marques, M. Eugénia V. Captivo:
Different stakeholders' perspectives for a surgical case assignment problem: Deterministic and robust approaches. Eur. J. Oper. Res. 261(1): 260-278 (2017) - 2016
- [j23]Maria da Graça Costa, Maria Eugénia V. Captivo:
Weight distribution in container loading: a case study. Int. Trans. Oper. Res. 23(1-2): 239-263 (2016) - 2014
- [j22]Sérgio Fernandes, M. Eugénia V. Captivo, João C. N. Clímaco:
A DSS for bicriteria location problems. Decis. Support Syst. 57: 224-244 (2014) - [c3]João C. N. Clímaco, Sérgio Fernandes, M. Eugénia V. Captivo:
A Discussion on the Role of Decision Support in a Location Analysis Case Study. DSS 2014: 141-152 - 2013
- [j21]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco, Ana Laranjeira:
Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11(3): 275-294 (2013) - 2012
- [j20]Inês Marques, M. Eugénia V. Captivo, Margarida Vaz Pato:
An integer programming approach to elective surgery scheduling. OR Spectr. 34(2): 407-427 (2012) - [c2]Sérgio Fernandes, M. Eugénia V. Captivo, João C. N. Clímaco:
A multi-attribute analysis module for SABILOC - a DSS for Location Problems. DSS 2012: 197-208 - 2010
- [j19]João C. N. Clímaco, M. Eugénia V. Captivo, Marta M. B. Pascoal:
On the bicriterion - minimal cost/minimal label - spanning tree problem. Eur. J. Oper. Res. 204(2): 199-205 (2010) - [c1]Sérgio Fernandes, M. Eugénia V. Captivo, João C. N. Clímaco:
A GIS embedded decision support system for bicriteria location problems. DSS 2010: 271-281
2000 – 2009
- 2009
- [j18]M. Eugénia V. Captivo, João C. N. Clímaco, Marta M. B. Pascoal:
A mixed integer linear formulation for the minimum label spanning tree problem. Comput. Oper. Res. 36(11): 3082-3085 (2009) - 2008
- [j17]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
A dynamic location problem with maximum decreasing capacities. Central Eur. J. Oper. Res. 16(3): 251-280 (2008) - [j16]Maria da Graça Costa, M. Eugénia V. Captivo, João C. N. Clímaco:
Capacitated single allocation hub location problem - A bi-criteria approach. Comput. Oper. Res. 35(11): 3671-3695 (2008) - [j15]M. Eugénia V. Captivo, João C. N. Clímaco:
On Multicriteria Mixed Integer Linear Programming Based Tools for Location Problems-An Updated Critical Overview Illustrated with a Bicriteria DSS. Computación y Sistemas 12(2) (2008) - [j14]Ana Respício, M. Eugénia V. Captivo:
Marketing-production Interface through an Integrated DSS. J. Decis. Syst. 17(1): 119-132 (2008) - [j13]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
A memetic algorithm for multi-objective dynamic location problems. J. Glob. Optim. 42(2): 221-253 (2008) - 2007
- [j12]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
Efficient primal-dual heuristic for a dynamic location problem. Comput. Oper. Res. 34(6): 1800-1823 (2007) - [j11]João C. N. Clímaco, Marta M. B. Pascoal, José M. F. Craveirinha, M. Eugénia V. Captivo:
Internet packet routing: Application of a K. Eur. J. Oper. Res. 181(3): 1045-1054 (2007) - [j10]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
Dynamic multi-level capacitated and uncapacitated location problems: an approach using primal-dual heuristics. Oper. Res. 7(3): 345-379 (2007) - [p1]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
A Memetic Algorithm for Dynamic Location Problems. Metaheuristics 2007: 225-244 - 2006
- [j9]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1): 5-21 (2006) - [j8]Isabel Correia, M. Eugénia V. Captivo:
Bounds for the single source modular capacitated plant location problem. Comput. Oper. Res. 33(10): 2991-3003 (2006) - 2005
- [j7]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
An algorithm for ranking quickest simple paths. Comput. Oper. Res. 32: 509-520 (2005) - 2004
- [j6]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
Erratum to "An interactive procedure dedicated to a bicriteria plant location model": [Computers & Operations Research 30 (2003) 1977-2002]. Comput. Oper. Res. 31(1): 155 (2004) - 2003
- [j5]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A note on a new variant of Murty's ranking assignments algorithm. 4OR 1(3): 243-255 (2003) - [j4]Isabel Correia, M. Eugénia V. Captivo:
A Lagrangean Heuristic for a Modular Capacitated Location Problem. Ann. Oper. Res. 122(1-4): 141-161 (2003) - [j3]M. Eugénia V. Captivo, João C. N. Clímaco, José Rui Figueira, Ernesto Martins, José Luís Santos:
Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12): 1865-1886 (2003) - [j2]Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco:
An interactive procedure dedicated to a bicriteria plant location model. Comput. Oper. Res. 30(13): 1977-2002 (2003) - [j1]Maria João Cortinhal, M. Eugénia V. Captivo:
Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. 151(2): 333-351 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
