Nicos Christofides

Affiliations:
  • Imperial College London, Department of Computing, UK


According to our database1, Nicos Christofides authored at least 35 papers between 1971 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem.
Oper. Res. Forum, 2022

2018
Robust risk budgeting.
Ann. Oper. Res., 2018

2014
Worst-case robust Omega ratio.
Eur. J. Oper. Res., 2014

2009
Exact methods for large-scale multi-period financial planning problems.
Comput. Manag. Sci., 2009

2008
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.
Math. Program., 2008

2006
A Branch-and-Bound Algorithm for Concave Network Flow Problems.
J. Glob. Optim., 2006

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems.
J. Glob. Optim., 2006

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems.
Eur. J. Oper. Res., 2006

2003
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems.
Networks, 2003

The design of corporate tax structures.
Math. Program., 2003

2001
Capital Budgeting Under Uncertainty - An Integrated Approach Using Contingent Claims Analysis and Integer Programming.
Oper. Res., 2001

1999
An efficient implementation of an algorithm for finding K shortest simple paths.
Networks, 1999

1997
Data structures for topological and geometric operations on networks.
Ann. Oper. Res., 1997

1996
Heuristic techniques in tax structuring for multinationals.
Proceedings of the IEEE/IAFE 1996 Conference on Computational Intelligence for Financial Engineering, 1996

1995
A new exact algorithm for the vehicle routing problem based on<i>q</i>-paths and<i>k</i>-shortest paths relaxations.
Ann. Oper. Res., 1995

1994
A graph-theoretic approach to distance transformations.
Pattern Recognit. Lett., 1994

1993
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs.
CVGIP Graph. Model. Image Process., 1993

Algorithms for large scale set covering problems.
Ann. Oper. Res., 1993

1989
An algorithm for the resource constrained shortest path problem.
Networks, 1989

An Exact Algorithm for the Quadratic Assignment Problem on a Tree.
Oper. Res., 1989

1987
Semi-independence number of a graph and the existence of Hamiltonian circuits.
Discret. Appl. Math., 1987

1984
The period routing problem.
Networks, 1984

1981
State-space relaxation procedures for the computation of bounds to routing problems.
Networks, 1981

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Math. Program., 1981

A restricted Lagrangean approach to the traveling salesman problem.
Math. Program., 1981

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
J. Comb. Theory B, 1981

1980
Dynamic Loading and Unloading of Liquids into Tanks.
Oper. Res., 1980

1977
An Algorithm for Two-Dimensional Cutting Problems.
Oper. Res., 1977

1974
Optimal expansion of an existing network.
Math. Program., 1974

Errata.
Oper. Res., 1974

1973
The Rearrangement of Items in a Warehouse.
Oper. Res., 1973

Large Scheduling Problems with Bivalent Costs.
Comput. J., 1973

1972
Technical Note - Bounds for the Travelling-Salesman Problem.
Oper. Res., 1972

1971
Zero-One Programming Using Non-Binary Tree-Search.
Comput. J., 1971

An Algorithm for the Chromatic Number of a Graph.
Comput. J., 1971


  Loading...