The following pages link to Nicos Christofides (Q948964):
Displaying 50 items.
- (Q839839) (redirect page) (← links)
- Exact methods for large-scale multi-period financial planning problems (Q839841) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Semi-independence number of a graph and the existence of Hamiltonian circuits (Q1088684) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- A tree search algorithm for the p-median problem (Q1162434) (← links)
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs (Q1170256) (← links)
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
- Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
- Data structures for topological and geometric operations on networks (Q1368372) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- The design of corporate tax structures (Q1424313) (← links)
- Robust risk budgeting (Q1621907) (← links)
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer (Q1820682) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- The optimal discretization of probability density functions (Q1978423) (← links)
- Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Worst-case robust Omega ratio (Q2514722) (← links)
- (Q3048582) (← links)
- (Q3048611) (← links)
- (Q3205014) (← links)
- The period routing problem (Q3329224) (← links)
- (Q3337973) (← links)
- Risk Exchange with Distorted Probabilities (Q3632869) (← links)
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming (Q3634995) (← links)
- (Q3688098) (← links)
- (Q3688099) (← links)
- An algorithm for the Rural Postman problem on a directed graph (Q3730368) (← links)
- Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees (Q3731630) (← links)
- An algorithm for the resource constrained shortest path problem (Q3827808) (← links)
- (Q3851932) (← links)
- Dynamic Loading and Unloading of Liquids into Tanks (Q3887189) (← links)
- State-space relaxation procedures for the computation of bounds to routing problems (Q3908783) (← links)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
- A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
- (Q3929516) (← links)
- A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem (Q3944021) (← links)
- (Q4068471) (← links)
- Note—A Computational Survey of Methods for the Set Covering Problem (Q4074311) (← links)
- (Q4083324) (← links)
- (Q4103312) (← links)
- An Algorithm for Two-Dimensional Cutting Problems (Q4146535) (← links)
- A Sequential Approach to the $0 - 1$ Linear Programming Problem (Q4146561) (← links)
- An efficient implementation of an algorithm for findingK shortest simple paths (Q4267389) (← links)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278) (← links)
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree (Q4732306) (← links)
