Discrete Optimization, Volume 3

Volume 3, Number 1, March 2006

• Gregory Gutin, Abraham Punnen:
  The traveling salesman problem. 1
  Electronic Edition (link) BibTeX
• Egon Balas, Robert Carr, Matteo Fischetti, Neil Simonetti:
  New facets of the STS polytope generated from known facets of the ATS polytope. 3-19
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Vicky Mak, Natashia Boland:
  Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. 33-49
  Electronic Edition (link) BibTeX
• Alexander Grigoriev, Joris van de Klundert:
  On the high multiplicity traveling salesman problem. 50-62
  Electronic Edition (link) BibTeX
• Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
  Iterative patching and the asymmetric traveling salesman problem. 63-77
  Electronic Edition (link) BibTeX
• Özlem Ergun, James B. Orlin:
  A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. 78-85
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo:
  Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. 86-94
  Electronic Edition (link) BibTeX

Volume 3, Number 2, June 2006

• Agostinho Agra, Miguel Constantino:
  Description of 2-integer continuous knapsack polyhedra. 95-110
  Electronic Edition (link) BibTeX
• Kevin K. H. Cheung:
  Facets of the independent path-matching polytope. 111-122
  Electronic Edition (link) BibTeX
• Mourad Baïou, José R. Correa:
  The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. 123-135
  Electronic Edition (link) BibTeX
• Samuel Fiorini:
  How to recycle your facets. 136-153
  Electronic Edition (link) BibTeX
• Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
  Augmenting forests to meet odd diameter requirements. 154-164
  Electronic Edition (link) BibTeX
• Gerhard F. Post, Gerhard J. Woeginger:
  Sports tournaments, home-away assignments, and the break minimization problem. 165-173
  Electronic Edition (link) BibTeX
• Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs:
  Berge's theorem for the maximum charge problem. 174-178
  Electronic Edition (link) BibTeX

Volume 3, Number 3, September 2006

• Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl:
  Graphs and combinatorial optimization. 179
  Electronic Edition (link) BibTeX
• Arianna Alfieri, Gaia Nicosia, Andrea Pacifici:
  Exact algorithms for a discrete metric labeling problem. 181-194
  Electronic Edition (link) BibTeX
• Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
  Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. 195-205
  Electronic Edition (link) BibTeX
• Gareth Bendall, François Margot:
  Minimum number of below average triangles in a weighted complete graph. 206-219
  Electronic Edition (link) BibTeX
• Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
  Tree decompositions of graphs: Saving memory in dynamic programming. 220-229
  Electronic Edition (link) BibTeX
• Takashi Doi, Toshihiro Fujito:
  A primal-dual method for approximating tree cover with two weights. 230-237
  Electronic Edition (link) BibTeX
• Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra:
  Algorithms for time-dependent bicriteria shortest path problems. 238-254
  Electronic Edition (link) BibTeX
• Giovanni Righini, Matteo Salani:
  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. 255-273
  Electronic Edition (link) BibTeX

Volume 3, Number 4, December 2006

• Reuven Bar-Yehuda, Dror Rawitz:
  Using fractional primal-dual to schedule split intervals with demands. 275-287
  Electronic Edition (link) BibTeX
• Gareth Bendall, François Margot:
  Greedy-type resistance of combinatorial problems. 288-298
  Electronic Edition (link) BibTeX
• Agustín Bompadre, Moshe Dror, James B. Orlin:
  Improved bounds for vehicle routing solutions. 299-316
  Electronic Edition (link) BibTeX
• Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
  Packing into the smallest square: Worst-case analysis of lower bounds. 317-326
  Electronic Edition (link) BibTeX
• Dorit S. Hochbaum, Asaf Levin:
  Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. 327-340
  Electronic Edition (link) BibTeX
• Tamás Kis:
  Polyhedral results on single node variable upper-bound flow models with allowed configurations. 341-353
  Electronic Edition (link) BibTeX
• Sigrid Knust, Michael von Thaden:
  Balanced home-away assignments. 354-365
  Electronic Edition (link) BibTeX
• Alexander V. Kononov, Bertrand M. T. Lin:
  On relocation problems with multiple identical working crews. 366-381
  Electronic Edition (link) BibTeX
• Günes Erdogan, Barbaros Tansel:
  A note on a polynomial time solvable case of the quadratic assignment problem. 382-384
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Khaled Salem, Hernán G. Abeledo:
  Hypergraphs and the Clar problem in hexagonal systems. 392-397
  Electronic Edition (link) BibTeX