Covering, Packing and Knapsack Problems
From MaRDI portal
Publication:4194731
DOI10.1016/S0167-5060(08)70831-8zbMath0407.90056OpenAlexW65792763MaRDI QIDQ4194731
Publication date: 1979
Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70831-8
Related Items
Exact methods for the knapsack problem and its generalizations, Reliability, covering and balanced matrices, Facets of the knapsack polytope derived from disjoint and overlapping index configurations, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, The Boolean quadratic polytope: Some characteristics, facets and relatives, On the facial structure of the set covering polytope, Facets and lifting procedures for the set covering polytope, A unified approach to approximating partial covering problems, Facet defining inequalities for the dichotomous knapsack problem, Conditional clusters, musters, and probability, A Boolean theory of signatures for tonal scales, Classical cuts for mixed-integer programming and branch-and-cut, Interval propagation to reason about sets: Definition and implementation of a practical language, Transitive packing, A characterization of knapsacks with the max-flow--min-cut property, A branch and cut algorithm for minimum spanning trees under conflict constraints, Polyhedral results for the precedence-constrained knapsack problem, Large-scale 0-1 linear programming on distributed workstations, Future paths for integer programming and links to artificial intelligence, Facets and algorithms for capacitated lot sizing, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, The simple plant location problem: Survey and synthesis, Valid inequalities for a class of assembly system problems, A concurrent processing framework for the set partitioning problem, The maximum clique problem, Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties, Cover and pack inequalities for (mixed) integer programming, Integer-programming software systems, Airline crew scheduling: state-of-the-art
