The Set-Partitioning Problem: Set Covering with Equality Constraints

DOI10.1287/opre.17.5.848zbMath0184.23101OpenAlexW2026615147MaRDI QIDQ5576127

Nemhauser, George I., Robert Garfinkel

Publication date: 1969

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

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

zbMATH Keywords

operations research

Related Items

A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Statistical search methods for lotsizing problems, Irregular polyomino tiling via integer programming with application in phased array antenna design, A framework for demand point and solution space aggregation analysis for location models, A surrogate heuristic for set covering problems, A dynamic programming approach to the complete set partitioning problem, Tighter representations for set partitioning problems, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, A network relaxation based enumeration algorithm for set partitioning, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Integral simplex using decomposition with primal cutting planes, Negotiation and cooperation in multi-agent environments, A combined hierarchical and steepest-descent clustering algorithm, Implicit enumeration algorithms for the set-partitioning problem, Set partitioning mit linearen Randbedingungen, A hybrid exact algorithm for complete set partitioning, The set partitioning problem in a quantum context, Locational analysis, Rounding to an integral program, Modeling and algorithmic development of a staff scheduling problem, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», On the facial structure of set packing polyhedra, Application of optimization methods to the hematological support of patients with disseminated malignancies, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, Algorithm for optimal winner determination in combinatorial auctions, Influence of the normalization constraint on the integral simplex using decomposition, Balancing modular transfer lines with serial-parallel activation of spindle heads at stations, Dual Inequalities for Stabilized Column Generation Revisited, Methods for task allocation via agent coalition formation, A shrunken cyclic inspection schedule for deteriorating production stages, Simple Lagrangian heuristic for the set covering problem, Efficient automated pallet loading, Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads, An efficient algorithm for the complete set partitioning problem, Production planning and scheduling for an integrated container company, Algorithms for large scale set covering problems, Experiments with parallel branch-and-bound algorithms for the set covering problem, A concurrent processing framework for the set partitioning problem, A set partitioning heuristic for the generalized assignment problem