Pages that link to "Item:Q3990562"

The following pages link to A Multiplier Adjustment Approach for the Set Partitioning Problem (Q3990562):

Displaying 14 items.

• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
• Penalty computations for the set partitioning problem (Q1309877) (← links)
• Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
• A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← 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)
• Tighter representations for set partitioning problems (Q1917353) (← links)
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
• Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
• Progress in Artificial Intelligence (Q5191553) (← links)
• (Q5485313) (← links)