Pages that link to "Item:Q1424281"

The following pages link to Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281):

Displaying 19 items.

• Continuous knapsack sets with divisible capacities (Q263180) (← links)
• Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Multi-commodity variable upper bound flow models (Q1751124) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
• Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
• A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
• The strength of multi-row models (Q2516350) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
• The continuous knapsack set (Q5962725) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)