Discrete Applied Mathematics, Volume 65
Volume 65, Numbers 1-3, 1996
- Srinivasa Rao Arikati, Uri N. Peled: A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. 5-20
- Achim Bachem, Winfried Hochstättler, Martin Malich: The Simulated Trading Heuristic for Solving Vehicle Routing Problems. 47-72
- Claude Berge: Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem. 73-79
- Jacek Blazewicz, Maciej Drozdowski, Dominique de Werra, Jan Weglarz: Deadline Scheduling of Multiprocessor Tasks. 81-95
- Peter Brucker, Johann Hurink, Frank Werner: Improving Local Search Heuristics for Some Scheduling Problems-I. 97-122
- Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger: Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. 123-139
- Jacques Carlier, Corinne Lucet: A Decomposition Algorithm for Network Reliability Evaluation. 141-156
- Maurice Cochand, Arlette Gaillard: on Preemptive Scheduling: A General Setting for the Two-phase Method. 157-166
- 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
- Mauro Dell'Amico, Francesco Maffioli: on Some Multicriteria Arborescence Problems: Complexity and Algorithms. 191-206
- Fred Glover: Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. 223-253
- Peter L. Hammer, Alexander K. Kelmans: Laplacian Spectra and Spanning Trees of Threshold Graphs. 255-273
- Alain Hertz, Yves Mottet, Yves Rochat: on a Scheduling Problem in a Robotized Analytical System. 285-318
- Alain Hertz, Marino Widmer: An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. 319-345
- 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
- Chính T. Hoàng: A Note on Perfectly orderable Graphs. 379-386
- Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Graphs with Largest Number of Minimum Cuts. 387-407
- Marcus Pattloch, Günter Schmidt: Lot-size Scheduling of Two Types of Jobs on Identical Machines. 409-419
- Henry Shum, Leslie E. Trotter Jr.: Cardinality-restricted Chains and Antichains in Partially ordered Sets. 421-439
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team