Pages that link to "Item:Q955334"

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

Displaying 5 items.

• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← 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 dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)