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

DOI10.1287/OPRE.23.1.74MaRDI QIDQ4088572zbMATH OpenOpenAlexWikidataFDO

Authors E. Balas, Manfred 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)

Cited in

(28)

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

This page was built for publication: On the Set-Covering Problem: II. An Algorithm for Set Partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088572)