Discrete Applied Mathematics, Volume 65

Volume 65, Numbers 1-3, 1996

• Alain Hertz, Maurice Queyranne, Marino Widmer:
  Preface. 1-3
  Electronic Edition (link) BibTeX
• Srinivasa Rao Arikati, Uri N. Peled:
  A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. 5-20
  Electronic Edition (link) BibTeX
• David Avis, Komei Fukuda:
  Reverse Search for Enumeration. 21-46
  Electronic Edition (link) BibTeX
• Achim Bachem, Winfried Hochstättler, Martin Malich:
  The Simulated Trading Heuristic for Solving Vehicle Routing Problems. 47-72
  Electronic Edition (link) BibTeX
• Claude Berge:
  Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem. 73-79
  Electronic Edition (link) BibTeX
• Jacek Blazewicz, Maciej Drozdowski, Dominique de Werra, Jan Weglarz:
  Deadline Scheduling of Multiprocessor Tasks. 81-95
  Electronic Edition (link) BibTeX
• Peter Brucker, Johann Hurink, Frank Werner:
  Improving Local Search Heuristics for Some Scheduling Problems-I. 97-122
  Electronic Edition (link) BibTeX
• Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger:
  Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. 123-139
  Electronic Edition (link) BibTeX
• Jacques Carlier, Corinne Lucet:
  A Decomposition Algorithm for Network Reliability Evaluation. 141-156
  Electronic Edition (link) BibTeX
• Maurice Cochand, Arlette Gaillard:
  on Preemptive Scheduling: A General Setting for the Two-phase Method. 157-166
  Electronic Edition (link) BibTeX
• Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura:
  A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. 167-190
  Electronic Edition (link) BibTeX
• Mauro Dell'Amico, Francesco Maffioli:
  on Some Multicriteria Arborescence Problems: Complexity and Algorithms. 191-206
  Electronic Edition (link) BibTeX
• Reinhardt Euler, Hervé Le Verge:
  Time-tables, Polyhedra and the Greedy Algorithm. 207-221
  Electronic Edition (link) BibTeX
• Fred Glover:
  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. 223-253
  Electronic Edition (link) BibTeX
• Peter L. Hammer, Alexander K. Kelmans:
  Laplacian Spectra and Spanning Trees of Threshold Graphs. 255-273
  Electronic Edition (link) BibTeX
• Pierre Hansen, Maolin Zheng:
  Shortest Shortest Path Trees of a Network. 275-284
  Electronic Edition (link) BibTeX
• Alain Hertz, Yves Mottet, Yves Rochat:
  on a Scheduling Problem in a Robotized Analytical System. 285-318
  Electronic Edition (link) BibTeX
• Alain Hertz, Marino Widmer:
  An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. 319-345
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, J. P. Liu, C. Zhao:
  Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle. 347-377
  Electronic Edition (link) BibTeX
• Chính T. Hoàng:
  A Note on Perfectly orderable Graphs. 379-386
  Electronic Edition (link) BibTeX
• Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
  Graphs with Largest Number of Minimum Cuts. 387-407
  Electronic Edition (link) BibTeX
• Marcus Pattloch, Günter Schmidt:
  Lot-size Scheduling of Two Types of Jobs on Identical Machines. 409-419
  Electronic Edition (link) BibTeX
• Henry Shum, Leslie E. Trotter Jr.:
  Cardinality-restricted Chains and Antichains in Partially ordered Sets. 421-439
  Electronic Edition (link) BibTeX