N
Nicos Christofides
Researcher at Imperial College London
Publications - 38
Citations - 5368
Nicos Christofides is an academic researcher from Imperial College London. The author has contributed to research in topics: Travelling salesman problem & Upper and lower bounds. The author has an hindex of 23, co-authored 38 publications receiving 5125 citations.
Papers
More filters
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
TL;DR: An O(n3) heuristic algorithm is described for solving d-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition and a worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2.
Journal ArticleDOI
An Algorithm for the Vehicle-dispatching Problem
Nicos Christofides,Samuel Eilon +1 more
TL;DR: The vehicle-scheduling problem involves the design of several vehicle tours to meet a given set of requirements for customers with known locations, subject to a capacity constraint for the vehicles and a distance constraint for vehicles.
Journal ArticleDOI
An Algorithm for Two-Dimensional Cutting Problems
TL;DR: A tree-search algorithm for two-dimensional cutting problems in which there is a constraint on the maximum number of each type of piece that is to be produced is presented.
Journal ArticleDOI
Project scheduling with resource constraints: A branch and bound approach
TL;DR: A branch and bound algorithm for project scheduling with resource constraints based on the idea of using disjunctive arcs for resolving conflicts that are created whenever sets of activities have to be scheduled whose total resource requirements exceed the resource availabilities in some periods is described.