default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 3
Volume 3, Number 1, March 2006
- Gregory Z. Gutin, Abraham P. Punnen:
The traveling salesman problem. 1 - Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
:
New facets of the STS polytope generated from known facets of the ATS polytope. 3-19 - Hanif D. Sherali, Subhash C. Sarin, Pei-Fang Tsai:
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. 20-32 - Vicky Mak, Natashia Boland:
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. 33-49 - Alexander Grigoriev, Joris van de Klundert:
On the high multiplicity traveling salesman problem. 50-62 - Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem. 63-77 - Özlem Ergun, James B. Orlin:
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. 78-85 - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. 86-94
Volume 3, Number 2, June 2006
- Agostinho Agra, Miguel Fragoso Constantino:
Description of 2-integer continuous knapsack polyhedra. 95-110 - Kevin K. H. Cheung:
Facets of the independent path-matching polytope. 111-122 - Mourad Baïou, José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. 123-135 - Samuel Fiorini:
How to recycle your facets. 136-153 - Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting forests to meet odd diameter requirements. 154-164 - Gerhard F. Post, Gerhard J. Woeginger:
Sports tournaments, home-away assignments, and the break minimization problem. 165-173 - Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs:
Berge's theorem for the maximum charge problem. 174-178
Volume 3, Number 3, September 2006
- Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl:
Graphs and combinatorial optimization. 179 - Arianna Alfieri, Gaia Nicosia, Andrea Pacifici:
Exact algorithms for a discrete metric labeling problem. 181-194 - Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. 195-205 - Gareth Bendall, François Margot:
Minimum number of below average triangles in a weighted complete graph. 206-219 - Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming. 220-229 - Takashi Doi, Toshihiro Fujito:
A primal-dual method for approximating tree cover with two weights. 230-237 - Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra:
Algorithms for time-dependent bicriteria shortest path problems. 238-254 - Giovanni Righini, Matteo Salani:
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. 255-273
Volume 3, Number 4, December 2006
- Reuven Bar-Yehuda, Dror Rawitz:
Using fractional primal-dual to schedule split intervals with demands. 275-287 - Gareth Bendall, François Margot:
Greedy-type resistance of combinatorial problems. 288-298 - Agustín Bompadre, Moshe Dror, James B. Orlin:
Improved bounds for vehicle routing solutions. 299-316 - Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. 317-326 - Dorit S. Hochbaum, Asaf Levin:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. 327-340 - Tamás Kis:
Polyhedral results on single node variable upper-bound flow models with allowed configurations. 341-353 - Sigrid Knust, Michael von Thaden:
Balanced home-away assignments. 354-365 - Alexander V. Kononov, Bertrand M. T. Lin:
On relocation problems with multiple identical working crews. 366-381 - Günes Erdogan, Barbaros Ç. Tansel:
A note on a polynomial time solvable case of the quadratic assignment problem. 382-384 - Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen:
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics. 385-391 - Khaled Salem, Hernán G. Abeledo:
Hypergraphs and the Clar problem in hexagonal systems. 392-397
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.
last updated on 2025-12-12 01:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
