default search action
Eleni Hadjiconstantinou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j16]Saïd Salhi, Richard W. Eglese, Eleni Hadjiconstantinou:
Preface: advances in theoretical and practical combinatorial optimization. Ann. Oper. Res. 272(1-2): 1-2 (2019) - 2018
- [j15]Stephan M. Wagner, Ruben Jönke, Eleni Hadjiconstantinou:
Relationship archetypes in aftermarkets. Int. J. Prod. Res. 56(6): 2250-2268 (2018) - 2010
- [j14]Eleni Hadjiconstantinou, Evelina Klerides:
A new path-based cutting plane approach for the discrete time-cost tradeoff problem. Comput. Manag. Sci. 7(3): 313-336 (2010) - [j13]Evelina Klerides, Eleni Hadjiconstantinou:
A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations. Comput. Oper. Res. 37(12): 2131-2140 (2010)
2000 – 2009
- 2008
- [j12]Nang Laik Ma, Eleni Hadjiconstantinou:
Evaluation of operational plans in container terminal yards using Discrete-Event Simulation. OR Insight 21(4): 10-18 (2008) - 2007
- [j11]Eleni Hadjiconstantinou, Manuel Iori:
A hybrid genetic algorithm for the two-dimensional single large object placement problem. Eur. J. Oper. Res. 183(3): 1150-1166 (2007) - 2006
- [j10]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174(2): 1205-1219 (2006) - [j9]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems. J. Glob. Optim. 34(1): 97-125 (2006) - [j8]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
A Branch-and-Bound Algorithm for Concave Network Flow Problems. J. Glob. Optim. 34(1): 127-155 (2006) - 2004
- [j7]Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi:
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Oper. Res. 52(5): 723-738 (2004) - [c1]Efstratios Rappos, Eleni Hadjiconstantinou:
An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks. ANTS Workshop 2004: 270-277 - 2003
- [j6]Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. Networks 41(4): 221-228 (2003) - [j5]Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi:
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42(1): 26-41 (2003) - 2002
- [j4]Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi:
A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29(4): 365-386 (2002) - [p1]Eleni Hadjiconstantinou, Daron Roberts:
Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers. The Vehicle Routing Problem 2002: 331-352
1990 – 1999
- 1999
- [j3]Eleni Hadjiconstantinou, Nicos Christofides:
An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34(2): 88-101 (1999) - 1998
- [j2]Eleni Hadjiconstantinou, Roberto Baldacci:
A multi-depot period vehicle routing problem arising in the utilities sector. J. Oper. Res. Soc. 49(12): 1239-1248 (1998) - 1995
- [j1]Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi:
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. Ann. Oper. Res. 61(1): 21-43 (1995)
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 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint