DBLP: Nicos Christofides

	2008
j15		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
j14		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
j13		Simon Christofides, Alexander Christofides, Nicos Christofides: The design of corporate tax structures. Math. Program. 98(1-3): 493-510 (2003)
j12		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
j11		Eleni Hadjiconstantinou, Nicos Christofides: An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34(2): 88-101 (1999)
	1994
j10		Yazid M. Sharaiha, Nicos Christofides: A graph-theoretic approach to distance transformations. Pattern Recognition Letters 15(10): 1035-1041 (1994)
	1993
j9		Nicos Christofides, José M. P. Paixão: Algorithms for large scale set covering problems. Annals OR 43(5): 259-277 (1993)
j8		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)
	1989
j7		J. E. Beasley, Nicos Christofides: An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989)
	1984
j6		Nicos Christofides, J. E. Beasley: The period routing problem. Networks 14(2): 237-256 (1984)
	1981
j5		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)
j4		Nicos Christofides, Aristide Mingozzi, Paolo Toth: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981)
	1973
j3		Nicos Christofides: Large Scheduling Problems with Bivalent Costs. Comput. J. 16(3): 262-264 (1973)
	1971
j2		Nicos Christofides: An Algorithm for the Chromatic Number of a Graph. Comput. J. 14(1): 38-39 (1971)
j1		Nicos Christofides: Zero-One Programming Using Non-Binary Tree-Search. Comput. J. 14(4): 418-421 (1971)

2008

j15

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

j14

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

j13

Simon Christofides, Alexander Christofides, Nicos Christofides: The design of corporate tax structures. Math. Program. 98(1-3): 493-510 (2003)

j12

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

j11

Eleni Hadjiconstantinou, Nicos Christofides: An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34(2): 88-101 (1999)

1994

j10

Yazid M. Sharaiha, Nicos Christofides: A graph-theoretic approach to distance transformations. Pattern Recognition Letters 15(10): 1035-1041 (1994)

1993

Nicos Christofides, José M. P. Paixão: Algorithms for large scale set covering problems. Annals OR 43(5): 259-277 (1993)

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)

1989

J. E. Beasley, Nicos Christofides: An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989)

1984

Nicos Christofides, J. E. Beasley: The period routing problem. Networks 14(2): 237-256 (1984)

1981

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)

Nicos Christofides, Aristide Mingozzi, Paolo Toth: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981)

1973

Nicos Christofides: Large Scheduling Problems with Bivalent Costs. Comput. J. 16(3): 262-264 (1973)

1971

Nicos Christofides: An Algorithm for the Chromatic Number of a Graph. Comput. J. 14(1): 38-39 (1971)

Nicos Christofides: Zero-One Programming Using Non-Binary Tree-Search. Comput. J. 14(4): 418-421 (1971)

1	Ahmed Ainouche	[j5]
2	Roberto Baldacci	[j15]
3	John E. Beasley (J. E. Beasley)	[j7] [j6]
4	Alexander Christofides	[j13]
5	Simon Christofides	[j13]
6	Dalila B. M. M. Fontes	[j14] [j12]
7	Eleni Hadjiconstantinou	[j14] [j12] [j11]
8	Aristide Mingozzi	[j15] [j4]
9	José M. P. Paixão	[j9]
10	Yazid M. Sharaiha	[j10] [j8]
11	Paolo Toth	[j4]

Nicos Christofides

Coauthor Index