Pages that link to "Item:Q5920488"

The following pages link to Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488):

Displaying 11 items.

• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Lifting, tilting and fractional programming revisited (Q614041) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)