Pages that link to "Item:Q4060729"
From MaRDI portal
The following pages link to An Algorithm for Large Set Partitioning Problems (Q4060729):
Displaying 22 items.
- An integer programming approach to generating airline crew pairings (Q958462) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- Implicit enumeration algorithms for the set-partitioning problem (Q1143941) (← links)
- Set partitioning mit linearen Randbedingungen (Q1144493) (← links)
- A multi-product loading problem: A model and solution method (Q1278990) (← links)
- A clustering heuristic to detect staircase structures in large scale linear programming models (Q1331570) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995) (← links)
- An algorithm for set covering problem (Q1823139) (← links)
- Efficient automated pallet loading (Q1825763) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
- Optimal set partitioning, matchings and lagrangian duality (Q3960468) (← links)
- Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
- Modeling and algorithmic development of a staff scheduling problem (Q5925863) (← links)