![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Nicos Christofides
Person information
- affiliation: Imperial College London, Department of Computing, UK
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j34]Nicos Christofides:
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Oper. Res. Forum 3(1) (2022)
2010 – 2019
- 2018
- [j33]Michalis Kapsos
, Nicos Christofides, Berç Rustem:
Robust risk budgeting. Ann. Oper. Res. 266(1-2): 199-221 (2018) - 2014
- [j32]Michalis Kapsos, Nicos Christofides, Berç Rustem:
Worst-case robust Omega ratio. Eur. J. Oper. Res. 234(2): 499-507 (2014)
2000 – 2009
- 2009
- [j31]Roberto Baldacci
, Marco A. Boschetti
, Nicos Christofides, Simon Christofides:
Exact methods for large-scale multi-period financial planning problems. Comput. Manag. Sci. 6(3): 281-306 (2009) - 2008
- [j30]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
- [j29]Dalila B. M. M. Fontes
, Eleni Hadjiconstantinou, Nicos Christofides:
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174(2): 1205-1219 (2006) - [j28]Dalila B. M. M. Fontes
, Eleni Hadjiconstantinou, Nicos Christofides:
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems. J. Glob. Optim. 34(1): 97-125 (2006) - [j27]Dalila B. M. M. Fontes
, Eleni Hadjiconstantinou, Nicos Christofides:
A Branch-and-Bound Algorithm for Concave Network Flow Problems. J. Glob. Optim. 34(1): 127-155 (2006) - 2003
- [j26]Simon Christofides, Alexander Christofides, Nicos Christofides:
The design of corporate tax structures. Math. Program. 98(1-3): 493-510 (2003) - [j25]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) - 2001
- [j24]Helga Meier, Nicos Christofides, Gerry Salkin:
Capital Budgeting Under Uncertainty - An Integrated Approach Using Contingent Claims Analysis and Integer Programming. Oper. Res. 49(2): 196-206 (2001)
1990 – 1999
- 1999
- [j23]Eleni Hadjiconstantinou, Nicos Christofides:
An efficient implementation of an algorithm for finding K shortest simple paths. Networks 34(2): 88-101 (1999) - 1997
- [j22]Nicos Christofides, H. O. Badra, Yazid M. Sharaiha:
Data structures for topological and geometric operations on networks. Ann. Oper. Res. 71: 259-289 (1997) - 1996
- [c1]D. Fatouros, Gerry Salkin, Nicos Christofides:
Heuristic techniques in tax structuring for multinationals. CIFEr 1996: 271-278 - 1995
- [j21]Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi:
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. Ann. Oper. Res. 61(1): 21-43 (1995) - 1994
- [j20]Yazid M. Sharaiha, Nicos Christofides:
A graph-theoretic approach to distance transformations. Pattern Recognit. Lett. 15(10): 1035-1041 (1994) - 1993
- [j19]Nicos Christofides, José M. P. Paixão:
Algorithms for large scale set covering problems. Ann. Oper. Res. 43(5): 259-277 (1993) - [j18]Yazid M. Sharaiha, Nicos Christofides:
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs. CVGIP Graph. Model. Image Process. 55(5): 397-407 (1993)
1980 – 1989
- 1989
- [j17]Nicos Christofides, Enrique Benavent:
An Exact Algorithm for the Quadratic Assignment Problem on a Tree. Oper. Res. 37(5): 760-768 (1989) - [j16]John E. Beasley
, Nicos Christofides:
An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989) - 1987
- [j15]Ahmed Ainouche, Nicos Christofides:
Semi-independence number of a graph and the existence of Hamiltonian circuits. Discret. Appl. Math. 17(3): 213-221 (1987) - 1984
- [j14]Nicos Christofides, John E. Beasley
:
The period routing problem. Networks 14(2): 237-256 (1984) - 1981
- [j13]Ahmed Ainouche, Nicos Christofides:
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. J. Comb. Theory B 31(3): 339-343 (1981) - [j12]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1): 255-282 (1981) - [j11]Egon Balas, Nicos Christofides:
A restricted Lagrangean approach to the traveling salesman problem. Math. Program. 21(1): 19-46 (1981) - [j10]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981) - 1980
- [j9]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Dynamic Loading and Unloading of Liquids into Tanks. Oper. Res. 28(3-Part-II): 633-649 (1980)
1970 – 1979
- 1977
- [j8]Nicos Christofides, Charles Whitlock:
An Algorithm for Two-Dimensional Cutting Problems. Oper. Res. 25(1): 30-44 (1977) - 1974
- [j7]Nicos Christofides:
Errata. Oper. Res. 22(5): 1121 (1974) - [j6]Nicos Christofides, P. Brooker:
Optimal expansion of an existing network. Math. Program. 6(1): 197-211 (1974) - 1973
- [j5]Nicos Christofides:
Large Scheduling Problems with Bivalent Costs. Comput. J. 16(3): 262-264 (1973) - [j4]Nicos Christofides, I. Colloff:
The Rearrangement of Items in a Warehouse. Oper. Res. 21(2): 577-589 (1973) - 1972
- [j3]Nicos Christofides:
Technical Note - Bounds for the Travelling-Salesman Problem. Oper. Res. 20(5): 1044-1056 (1972) - 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)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint