 | 2010 |
|---|
| 10 |       | Evelina Klerides,
Eleni Hadjiconstantinou:
A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations.
Computers & OR 37(12): 2131-2140 (2010) |
| 2008 |
|---|
| 9 | | 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 |
|---|
| 8 | | Eleni Hadjiconstantinou,
Manuel Iori:
A hybrid genetic algorithm for the two-dimensional single large object placement problem.
European Journal of Operational Research 183(3): 1150-1166 (2007) |
| 2006 |
|---|
| 7 | | Dalila B. M. M. Fontes,
Eleni Hadjiconstantinou,
Nicos Christofides:
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems.
European Journal of Operational Research 174(2): 1205-1219 (2006) |
| 2004 |
|---|
| 6 | | Efstratios Rappos,
Eleni Hadjiconstantinou:
An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks.
ANTS Workshop 2004: 270-277 |
| 5 | | Roberto Baldacci,
Eleni Hadjiconstantinou,
Aristide Mingozzi:
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.
Operations Research 52(5): 723-738 (2004) |
| 2003 |
|---|
| 4 | | 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) |
| 3 | | 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 |
|---|
| 2 | | Roberto Baldacci,
Eleni Hadjiconstantinou,
Vittorio Maniezzo,
Aristide Mingozzi:
A new method for solving capacitated location problems based on a set partitioning approach.
Computers & OR 29(4): 365-386 (2002) |
| 1999 |
|---|
| 1 | | Eleni Hadjiconstantinou,
Nicos Christofides:
An efficient implementation of an algorithm for finding K shortest simple paths.
Networks 34(2): 88-101 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page