Pages that link to "Item:Q955334"

The following pages link to A dual ascent procedure for the set partitioning problem (Q955334):

Displaying 12 items.

• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
• An extension of set partitioning with application to scheduling problems (Q1060959) (← 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)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• A Lagrangian Relaxation Algorithm for Modularity Maximization Problem (Q2806937) (← links)
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)
• A Multiplier Adjustment Approach for the Set Partitioning Problem (Q3990562) (← links)
• A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)