Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Nicos Christofides - MaRDI portal

Nicos Christofides

From MaRDI portal
(Redirected from Person:839839)
Person:948964

Available identifiers

zbMath Open christofides.nicosDBLP93/5885WikidataQ13988699 ScholiaQ13988699MaRDI QIDQ948964

List of research outcomes





PublicationDate of PublicationType
Worst-case analysis of a new heuristic for the travelling salesman problem2022-03-31Paper
Robust risk budgeting2018-11-12Paper
Worst-case robust Omega ratio2015-02-03Paper
Exact methods for large-scale multi-period financial planning problems2009-09-03Paper
https://portal.mardi4nfdi.de/entity/Q53246402009-08-03Paper
Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming2009-07-03Paper
Risk Exchange with Distorted Probabilities2009-06-15Paper
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts2008-10-16Paper
Implied non-recombining trees and calibration for the volatility smile2007-10-22Paper
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems2006-09-13Paper
Lower bounds from state space relaxations for concave cost network flow problems2006-06-28Paper
A branch-and-bound algorithm for concave network flow problems2006-06-28Paper
The design of corporate tax structures2004-03-11Paper
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems2003-07-31Paper
An efficient implementation of an algorithm for findingK shortest simple paths2001-05-02Paper
The optimal discretization of probability density functions2000-06-04Paper
Vehicle routing with a sparse feasibility graph1999-02-22Paper
An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts1998-06-11Paper
An exact algorithm for general, orthogonal, two-dimensional knapsack problems1998-06-11Paper
Data structures for topological and geometric operations on networks1997-11-26Paper
Capacitated clustering problems by hybrid simulated annealing and tabu search1996-10-30Paper
A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations1996-03-18Paper
An algorithm for the resource constrained shortest path problem1989-01-01Paper
An Exact Algorithm for the Quadratic Assignment Problem on a Tree1989-01-01Paper
Semi-independence number of a graph and the existence of Hamiltonian circuits1987-01-01Paper
Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer1987-01-01Paper
An algorithm for the Rural Postman problem on a directed graph1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36880981985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36880991985-01-01Paper
Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees1985-01-01Paper
The period routing problem1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33379731984-01-01Paper
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem1983-01-01Paper
A tree search algorithm for the p-median problem1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47440641982-01-01Paper
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs1981-01-01Paper
State-space relaxation procedures for the computation of bounds to routing problems1981-01-01Paper
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations1981-01-01Paper
A restricted Lagrangean approach to the traveling salesman problem1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39295161981-01-01Paper
A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem1981-01-01Paper
Contributions to the quadratic assignment problem1980-01-01Paper
Dynamic Loading and Unloading of Liquids into Tanks1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30485821979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30486111979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32050141979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38519321979-01-01Paper
An Algorithm for Two-Dimensional Cutting Problems1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41033121976-01-01Paper
A Sequential Approach to the $0 - 1$ Linear Programming Problem1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40684711975-01-01Paper
Note—A Computational Survey of Methods for the Set Covering Problem1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40833241975-01-01Paper
Errata1974-01-01Paper
Algorithms for Large-scale Travelling Salesman Problems1972-01-01Paper
Technical Note—Bounds for the Travelling-Salesman Problem1972-01-01Paper
The Loading Problem1971-01-01Paper
An algorithm for the chromatic number of a graph1971-01-01Paper
The Optimum Location of Multi-centres on a Graph1971-01-01Paper
Zero-one programming using non-binary tree-search1971-01-01Paper

Research outcomes over time

This page was built for person: Nicos Christofides