default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 76
Volume 76, Number 1-3, June 1997
- Paola Bertolazzi, Caterina De Simone, Anna Galluccio:
A Nice Class for the Vertex Packing Problem. 3-19 - Jacek Blazewicz
, Maciej Drozdowski:
Distributed Processing of Divisible Jobs with Communication Startup Costs. 21-41 - Peter Brucker, Johann L. Hurink, Bernd Jurisch, Birgit Wöstmann:
A Branch & Bound Algorithm for the Open-shop Problem. 43-59 - Jacques Carlier, Yu Li, Jean-Luc Lutton:
Reliability Evaluation of Large Telecommunication Networks. 61-80 - Maurice Cochand, Arlette Gaillard, Heinz Gröflin:
Optimum Partitioning into Intersections of Ring Families. 81-91 - Dominique de Werra, Nadimpalli V. R. Mahadev:
Preassignment Requirements in Chromatic Scheduling. 93-101 - Mauro Dell'Amico, Silvano Martello:
The k-cardinality Assignment Problem. 103-121 - Gerd Finke, H. Jiang:
A Variant of the Permutation Flow Shop Model with Variable Processing Times. 123-140 - Alain Gaillard:
Switchdec Polyhedra. 141-163 - Erwin Pesch, Fred W. Glover:
TSP Ejection Chains. 165-181 - Alain Hertz:
On the Use of Boolean Methods for the Computation of the Stability Number. 183-203 - Anthony J. W. Hilton, C. Zhao:
Vertex-splitting and Chromatic Index Critical Graphs. 205-211 - Marek Kubale:
Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals. 213-223 - Nadimpalli V. R. Mahadev, Fred S. Roberts:
Amenable Colorings. 225-238 - Maurice Queyranne, Frits C. R. Spieksma:
Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs. 239-253
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 2024-09-14 23:51 CEST 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:
