scientific article; zbMATH DE number 3593565
From MaRDI portal
zbMath0382.05001MaRDI QIDQ4161330
Michael R. Garey, David S. Johnson
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05) Combinatorial aspects of packing and covering (05B40) Algorithms in computer science (68W99) Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04) Operations research and management science (90Bxx)
Related Items
Worst-Case Analysis of Network Design Problem Heuristics, Probabilistic analysis of a network design problem heuristic, Infeasibility of instance compression and succinct PCPs for NP, Toward a unified approach for the classification of NP-complete optimization problems, Probabilistic analysis for simple one- and two-dimensional bin packing algorithms, Non deterministic polynomial optimization problems and their approximations, Discrete extremal problems, General approximation algorithms for some arithmetical combinatorial problems, On the relationship between the biconnectivity augmentation and traveling salesman problems, Efficient Algorithms for (3,1) Graphs, The connection between the bump number problem and flow-shop scheduling with precedence constraints, An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs, Fast algorithms for bin packing
