| 2008 |
|---|
| 10 | EE | Roberto Baldacci,
Nicos Christofides,
Aristide Mingozzi:
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.
Math. Program. 115(2): 351-385 (2008) |
| 2006 |
|---|
| 9 | EE | 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) |
| 2003 |
|---|
| 8 | EE | 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) |
| 1999 |
|---|
| 7 | EE | Eleni Hadjiconstantinou,
Nicos Christofides:
An efficient implementation of an algorithm for finding K shortest simple paths.
Networks 34(2): 88-101 (1999) |
| 1994 |
|---|
| 6 | EE | Yazid M. Sharaiha,
Nicos Christofides:
A graph-theoretic approach to distance transformations.
Pattern Recognition Letters 15(10): 1035-1041 (1994) |
| 1993 |
|---|
| 5 | | Yazid M. Sharaiha,
Nicos Christofides:
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs.
CVGIP: Graphical Model and Image Processing 55(5): 397-407 (1993) |
| 1981 |
|---|
| 4 | EE | Ahmed Ainouche,
Nicos Christofides:
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
J. Comb. Theory, Ser. B 31(3): 339-343 (1981) |
| 1973 |
|---|
| 3 | | Nicos Christofides:
Large Scheduling Problems with Bivalent Costs.
Comput. J. 16(3): 262-264 (1973) |
| 1971 |
|---|
| 2 | | Nicos Christofides:
An Algorithm fot the Chromatic Number of a Graph.
Comput. J. 14(1): 38-39 (1971) |
| 1 | | Nicos Christofides:
Zero-One Programming Using Non-Binary Tree-Search.
Comput. J. 14(4): 418-421 (1971) |
