Pages that link to "Item:Q2884506"

The following pages link to A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems (Q2884506):

Displayed 8 items.

• A dual ascent procedure for the set partitioning problem (Q955334) ‎ (← links)
• The matching relaxation for a class of generalized set partitioning problems (Q1634772) ‎ (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) ‎ (← links)
• Modelling transfer line design problem via a set partitioning problem (Q1758032) ‎ (← links)
• Integral simplex using double decomposition for set partitioning problems (Q2273675) ‎ (← links)
• A new modeling and solution approach for the set-partitioning problem (Q2456638) ‎ (← links)
• OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) ‎ (← links)
• Solving Graph Partitioning Problems with Parallel Metaheuristics (Q4609771) ‎ (← links)