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