On the Set-Covering Problem: II. An Algorithm for Set Partitioning

DOI10.1287/opre.23.1.74zbMath0324.90045OpenAlexW2136023107WikidataQ94974435 ScholiaQ94974435MaRDI QIDQ4088572

Egon Balas, Manfred W. Padberg

Publication date: 1975

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items

Improved integral simplex using decomposition for the set partitioning problem, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Distributed integral column generation for set partitioning problems, Tighter representations for set partitioning problems, A network relaxation based enumeration algorithm for set partitioning, Logic applied to integer programming and integer programming applied to logic, Integral simplex using decomposition with primal cutting planes, 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, Set partitioning mit linearen Randbedingungen, Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling, The three-dimensional assignment and partition problems. New lower bounds, Column generation in the integral simplex method, A characterization of the uncapacitated network design polytope, Modeling and algorithmic development of a staff scheduling problem, Lineare Charakterisierungen von Travelling Salesman Problemen, Non-standard approaches to integer programming, Adjacency on polymatroids, Integral simplex using double decomposition for set partitioning problems, Influence of the normalization constraint on the integral simplex using decomposition, Improving set partitioning problem solutions by zooming around an improving direction, Methods for task allocation via agent coalition formation, The simple plant location problem: Survey and synthesis, Adjacency on combinatorial polyhedra, Clustering heuristics for set covering, Integral Simplex Using Decomposition for the Set Partitioning Problem