Pages that link to "Item:Q2884506"

The following pages link to A parallel, linear programming-based heuristic for large-scale set partitioning problems (Q2884506):

Displaying 13 items.

• A parallel implementation of the column subtraction algorithm (Q673834) (← links)
• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• Partitioning mathematical programs for parallel solution (Q1380936) (← links)
• A concurrent processing framework for the set partitioning problem (Q1603333) (← 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)
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
• Integral simplex using double decomposition for set partitioning problems (Q2273675) (← links)
• On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← 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)