The Set-Partitioning Problem: Set Covering with Equality Constraints
From MaRDI portal
Cited in
(41)- Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
- 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
- A dynamic programming approach to the complete set partitioning problem
- A network relaxation based enumeration algorithm for set partitioning
- A combined hierarchical and steepest-descent clustering algorithm
- Implicit enumeration algorithms for the set-partitioning problem
- Set partitioning mit linearen Randbedingungen
- Locational analysis
- Application of optimization methods to the hematological support of patients with disseminated malignancies
- 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
- Algorithms for large scale set covering problems
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- A set partitioning heuristic for the generalized assignment problem
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- A surrogate heuristic for set covering problems
- Negotiation and cooperation in multi-agent environments
- A concurrent processing framework for the set partitioning problem
- Integral simplex using decomposition with primal cutting planes
- Efficient automated pallet loading
- A framework for demand point and solution space aggregation analysis for location models
- 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 combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- Statistical search methods for lotsizing problems
- Dual inequalities for stabilized column generation revisited
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
- On the facial structure of set packing polyhedra
- Modeling and algorithmic development of a staff scheduling problem
- Algorithm for optimal winner determination in combinatorial auctions
- The set partitioning problem in a quantum context
- Preference learning for efficient bundle selection in horizontal transport collaborations
- Influence of the normalization constraint on the integral simplex using decomposition
- A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
- A hybrid exact algorithm for complete set partitioning
- Rounding to an integral program
This page was built for publication: The Set-Partitioning Problem: Set Covering with Equality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576127)
