On the Set-Covering Problem

DOI10.1287/opre.20.6.1152zbMath0254.90035OpenAlexW2171471009MaRDI QIDQ5668245

Egon Balas, Manfred W. Padberg

Publication date: 1972

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.20.6.1152

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Related Items

Improved integral simplex using decomposition for the set partitioning problem, Simplex pivots on the set packing polytope, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Irregular polyomino tiling via integer programming with application in phased array antenna design, All-integer column generation for set partitioning: basic principles and extensions, Some recognition problems related to graph isomorphism, On discrete optimization with ordering, The Boolean quadratic polytope: Some characteristics, facets and relatives, A network relaxation based enumeration algorithm for set partitioning, Negotiation and cooperation in multi-agent environments, Integral Column Generation for Set Partitioning Problems with Side Constraints, Implicit enumeration algorithms for the set-partitioning problem, A fundamental problem in linear inequalities with applications to the travelling salesman problem, An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids, A Boolean theory of signatures for tonal scales, An algorithm to evaluate public transportation stops for minimizing passenger walking distance, The travelling salesman problem and a class of polyhedra of diameter two, Column generation in the integral simplex method, Ordered weighted average optimization in multiobjective spanning tree problem, A characterization of the uncapacitated network design polytope, Lineare Charakterisierungen von Travelling Salesman Problemen, Pseudo-Boolean optimization, Adjacency on polymatroids, On the facial structure of set packing polyhedra, Application of optimization methods to the hematological support of patients with disseminated malignancies, Improving set partitioning problem solutions by zooming around an improving direction, Fuzzy-probabilistic aggregations in the discrete covering problem, Methods for task allocation via agent coalition formation, Maximization of submodular functions: theory and enumeration algorithms, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, The simple plant location problem: Survey and synthesis, Adjacency on combinatorial polyhedra, Bibliography on domination in graphs and some basic definitions of domination parameters, Perfect zero–one matrices, Integral Simplex Using Decomposition for the Set Partitioning Problem