| An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation R Baldacci, E Hadjiconstantinou, A Mingozzi Operations research 52 (5), 723-738, 2004 | 424 | 2004 |
| An exact algorithm for general, orthogonal, two-dimensional knapsack problems E Hadjiconstantinou, N Christofides European Journal of Operational Research 83 (1), 39-56, 1995 | 216 | 1995 |
| An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts N Christofides, E Hadjiconstantinou European Journal of Operational Research 83 (1), 21-38, 1995 | 199 | 1995 |
| A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations E Hadjiconstantinou, N Christofides, A Mingozzi Annals of Operations Research 61, 21-43, 1995 | 161 | 1995 |
| An efficient implementation of an algorithm for finding K shortest simple paths E Hadjiconstantinou, N Christofides Networks: An International Journal 34 (2), 88-101, 1999 | 157 | 1999 |
| A multi-depot period vehicle routing problem arising in the utilities sector E Hadjiconstantinou, R Baldacci Journal of the Operational Research Society 49, 1239-1248, 1998 | 110 | 1998 |
| An exact algorithm for the traveling salesman problem with deliveries and collections R Baldacci, E Hadjiconstantinou, A Mingozzi Networks: An International Journal 42 (1), 26-41, 2003 | 93 | 2003 |
| A new method for solving capacitated location problems based on a set partitioning approach R Baldacci, E Hadjiconstantinou, V Maniezzo, A Mingozzi Computers & operations research 29 (4), 365-386, 2002 | 88 | 2002 |
| Tools for reformulating logical forms into zero-one mixed integer programs G Mitra, C Lucas, S Moody, E Hadjiconstantinou European Journal of Operational Research 72 (2), 262-276, 1994 | 79 | 1994 |
| A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations E Klerides, E Hadjiconstantinou Computers & Operations Research 37 (12), 2131-2140, 2010 | 76 | 2010 |
| New upper bounds for the two‐dimensional orthogonal non‐guillotine cutting stock problem MA Boschetti, A Mingozzi, E Hadjiconstantinou IMA Journal of Management Mathematics 13 (2), 95-119, 2002 | 76 | 2002 |
| A hybrid genetic algorithm for the two-dimensional single large object placement problem E Hadjiconstantinou, M Iori European Journal of Operational Research 183 (3), 1150-1166, 2007 | 70 | 2007 |
| Routing under uncertainty: an application in the scheduling of field service engineers E Hadjiconstantinou, D Roberts The vehicle routing problem, 331-352, 2002 | 47 | 2002 |
| A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems DBMM Fontes, E Hadjiconstantinou, N Christofides European Journal of Operational Research 174 (2), 1205-1219, 2006 | 42 | 2006 |
| Quick response in the supply chain E Hadjiconstantinou Springer Science & Business Media, 2012 | 40 | 2012 |
| Upper bounds for single‐source uncapacitated concave minimum‐cost network flow problems DBMM Fontes, E Hadjiconstantinou, N Christofides Networks: An International Journal 41 (4), 221-228, 2003 | 32 | 2003 |
| A branch-and-bound algorithm for concave network flow problems DBMM Fontes, E Hadjiconstantinou, N Christofides Journal of Global Optimization 34, 127-155, 2006 | 30 | 2006 |
| An exact algorithm for the vehicle routing problem based on the set partitioning formulation A Mingozzi, N Christofides, E Hadjiconstantinou Unpublished manuscript, June, 1994 | 28 | 1994 |
| Evaluating straddle carrier deployment policies: a simulation study for the Piraeus container terminal E Hadjiconstantinou, NL Ma Maritime Policy & Management 36 (4), 353-366, 2009 | 25 | 2009 |
| A new path-based cutting plane approach for the discrete time-cost tradeoff problem E Hadjiconstantinou, E Klerides Computational Management Science 7 (3), 313-336, 2010 | 20 | 2010 |
