Volume 49,
Number 1-3,
1994
- O. Bahn, Jean-Louis Goffin, Jean-Philippe Vial, O. Du Merle:
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.
3-23 BibTeX
- Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma:
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
25-50 BibTeX
- Alain Billionnet, Marie-Christine Costa:
Solving the Uncapacited Plant Location Problem on Trees.
51-59 BibTeX
- Gary S. Bloom, Sergio Ruiz:
Decompositions into Linear Forests and Difference Labelings of Graphs.
61-75 BibTeX
- Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir:
Balancing Problems in Acyclic Networks.
77-93 BibTeX
- Richard C. Brewster:
The Complexity of Colouring Symmetric Relational Systems.
95-105 BibTeX
- Peter Brucker, Bernd Jurisch, Bernd Sievers:
A Branch and Bound Algorithm for the Job-Shop Scheduling Problem.
107-127 BibTeX
- Philippe Chrétienne:
Tree Scheduling with Communication Delays.
129-141 BibTeX
- M. Chochand:
Probabilistic Estimates for the Generalized Maximum Satisfiability Problem.
143-163 BibTeX
- Dominique de Werra, Y. Gay:
Chromatic Scheduling and Frequency Assignment.
165-174 BibTeX
- Didier Fayard, Gérard Plateau:
An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem.
175-187 BibTeX
- Arnaud Fréville, Gérard Plateau:
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem.
189-212 BibTeX
- Joseph A. Gallian:
A Guide to the Graph Labeling Zoo.
213-229 BibTeX
- Fred Glover:
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms).
231-255 BibTeX
- Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragão:
Local Optima Topology for the k-Coloring Problem.
257-280 BibTeX
- Bruno Leclerc:
Medians for Weight Metrics in the Covering Graphs of Semilattices.
281-297 BibTeX
- François Margot:
Some Complexity Results about Threshold Graphs.
299-308 BibTeX
- Uri N. Peled, Bruno Simeone:
A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function.
309-323 BibTeX
- Uri N. Peled, Feng Sun:
Total Matchings and Total Coverings of Threshold Graphs.
325-330 BibTeX
- Fred S. Roberts, Yonghua Xu:
On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets.
331-356 BibTeX
- Hanif D. Sherali, Sridhar Ramachandran, Seong-in Kim:
A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem.
357-378 BibTeX
Copyright © Sat May 16 23:55:10 2009
by Michael Ley (ley@uni-trier.de)
