An Algorithm for Large Set Partitioning Problems
From MaRDI portal
Cited in
(22)- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- Aggregation of constraints in integer programming
- A network relaxation based enumeration algorithm for set partitioning
- Implicit enumeration algorithms for the set-partitioning problem
- Set partitioning mit linearen Randbedingungen
- A multi-product loading problem: A model and solution method
- A clustering heuristic to detect staircase structures in large scale linear programming models
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- A surrogate heuristic for set covering problems
- A concurrent processing framework for the set partitioning problem
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
- An algorithm for set covering problem
- Efficient automated pallet loading
- A monotonic, dual-based bounding procedure for integer programs
- A dual strategy for solving the linear programming relaxation of a driver scheduling system
- Tighter representations for set partitioning problems
- Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
- Optimal set partitioning, matchings and lagrangian duality
- Use of hidden network structure in the set partitioning problem
- Modeling and algorithmic development of a staff scheduling problem
- An integer programming approach to generating airline crew pairings
This page was built for publication: An Algorithm for Large Set Partitioning Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060729)
