UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

The traveling salesman problem: a case study

Local Search in Combinatorial Optimization, 2018, p.215-310

2018

Volltextzugriff (PDF)

The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

Algorithm Engineering and Experimentation, 2001, Vol.2153, p.32-59

2001

Volltextzugriff (PDF)

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

Operations research, 1989-12, Vol.37 (6), p.865-892

1989

Volltextzugriff (PDF)

Finding a maximum-genus graph imbedding

Journal of the ACM, 1988-07, Vol.35 (3), p.523-534

1988

Volltextzugriff (PDF)

Competitive algorithms for server problems

Journal of algorithms, 1990-06, Vol.11 (2), p.208-230

1990

Volltextzugriff (PDF)

Competitive paging algorithms

Journal of algorithms, 1991, Vol.12 (4), p.685-699

1991

Volltextzugriff (PDF)

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

Operations research, 1991-05, Vol.39 (3), p.378-406

1991

Volltextzugriff (PDF)

Local search in combinatorial optimization

1, 2018

Volltextzugriff (PDF)

The Traveling Salesman Problem and Its Variations

1, 2002

Volltextzugriff (PDF)

Implementation Challenge for TSP Heuristics

Encyclopedia of Algorithms, 2016, p.952-954

2016

Volltextzugriff (PDF)

A strongly competitive randomized paging algorithm

Algorithmica, 1991-06, Vol.6 (1-6), p.816-825

1991

Volltextzugriff (PDF)

Adaptive caching for demand prepaging

International Symposium on Memory Management: Proceedings of the 3rd international symposium on Memory management; 20-21 June 2002, 2002, p.114-126

2002

Volltextzugriff (PDF)

The traveling salesman problem: a case study

Local Search in Combinatorial Optimization, 2018, p.215-310

2018

Volltextzugriff (PDF)

After Liberalism

Historian, 1997, Vol.59 (3), p.721-722

McGeoch, Lyle A.

1997

Volltextzugriff (PDF)

On the Road to War: British Foreign Policy in Transition, 1905–1906

The Review of politics, 1973-04, Vol.35 (2), p.204-218

McGeoch, Lyle A.

1973

Volltextzugriff (PDF)

The Limits of British Influence: South Asia and the Anglo-American Relationship, 1947–56

The Historian, 1994, Vol.57 (1), p.157-158

McGeoch, Lyle A.

1994

Volltextzugriff (PDF)

Competitive algorithms for on-line problems

Proceedings of the twentieth annual ACM symposium on Theory of computing, 1988, p.322-333

1988

Volltextzugriff (PDF)

Channel Tunnel Visions, 1850-1945: Dreams and Nightmares

American historical review, 1996, Vol.101 (4), p.1211-1212

McGeoch, Lyle A.

1996

Volltextzugriff (PDF)

Implementation Challenge for TSP Heuristics: 2002; Johnson, McGeoch2002; Johnson, McGeoch

Encyclopedia of Algorithms, 2008, p.1-99

2008

Volltextzugriff (PDF)

Emigrants and Empire: British Settlement in the Dominions Between the Wars: Constantine, Stephen, ed.: New York: Manchester University Press, 208 pp., Publication Date: December 1990

History (Washington), 1992-06, Vol.20 (4), p.153-153

McGeoch, Lyle A.

1992

Volltextzugriff (PDF)

The Decline and Fall of the British Aristocracy: Cannadine, David: New Haven, CT: Yale University Press, 813 pp., Publication Date: November 1990

History (Washington), 1991-07, Vol.20 (1), p.15-16

McGeoch, Lyle A.

1991

Volltextzugriff (PDF)

Roger Bullen, editor. The Foreign Office, 1782-1982. Frederick, Md.: University Publications of America. 1984. Pp. x, 141. n.p

Albion (Boone), 1985, Vol.17 (4), p.508-509

McGeoch, Lyle A.

1985

Volltextzugriff (PDF)

Experimental Analysis of Heuristics for the STSP

The Traveling Salesman Problem and Its Variations, 2007, p.369-443

2007

Volltextzugriff (PDF)

Optimization By Simulated Annealing: An Experimental Evalua

Operations research, 1989-11, Vol.37 (6), p.865

1989

Volltextzugriff (PDF)

Deadly Imbalances: Tripolarity and Hilter's Strategy of World Conquest

History, 1999, Vol.27 (2), p.71

McGeoch, Lyle A

1999

Volltextzugriff (PDF)

1 – 25 von 55

Menü

Weitere Dienste

Einstellungen

The traveling salesman problem: a case study

The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

Finding a maximum-genus graph imbedding

Competitive algorithms for server problems

Competitive paging algorithms

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

Local search in combinatorial optimization

The Traveling Salesman Problem and Its Variations

Implementation Challenge for TSP Heuristics

A strongly competitive randomized paging algorithm

Adaptive caching for demand prepaging

The traveling salesman problem: a case study

After Liberalism

On the Road to War: British Foreign Policy in Transition, 1905–1906

The Limits of British Influence: South Asia and the Anglo-American Relationship, 1947–56

Competitive algorithms for on-line problems

Channel Tunnel Visions, 1850-1945: Dreams and Nightmares

Implementation Challenge for TSP Heuristics: 2002; Johnson, McGeoch2002; Johnson, McGeoch

Emigrants and Empire: British Settlement in the Dominions Between the Wars: Constantine, Stephen, ed.: New York: Manchester University Press, 208 pp., Publication Date: December 1990

The Decline and Fall of the British Aristocracy: Cannadine, David: New Haven, CT: Yale University Press, 813 pp., Publication Date: November 1990

Roger Bullen, editor. The Foreign Office, 1782-1982. Frederick, Md.: University Publications of America. 1984. Pp. x, 141. n.p

Experimental Analysis of Heuristics for the STSP

Optimization By Simulated Annealing: An Experimental Evalua

Deadly Imbalances: Tripolarity and Hilter's Strategy of World Conquest

Suchergebnisse filtern