An Algorithm for Large Set Partitioning Problems

Cited In (22)

An integer programming approach to generating airline crew pairings
A multi-product loading problem: A model and solution method
Efficient automated pallet loading
Use of hidden network structure in the set partitioning problem
A concurrent processing framework for the set partitioning problem
A monotonic, dual-based bounding procedure for integer programs
A dual strategy for solving the linear programming relaxation of a driver scheduling system
A network relaxation based enumeration algorithm for set partitioning
A surrogate heuristic for set covering problems
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
Modeling and algorithmic development of a staff scheduling problem
Implicit enumeration algorithms for the set-partitioning problem
Set partitioning mit linearen Randbedingungen
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
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
A clustering heuristic to detect staircase structures in large scale linear programming models
An algorithm for set covering problem
Optimal set partitioning, matchings and lagrangian duality
Tighter representations for set partitioning problems
Aggregation of constraints in integer programming
Optimal set-partitioning based on group quality likelihood using partition-growing algorithm

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)