Pages that link to "Item:Q1977865"
From MaRDI portal
The following pages link to Sequence independent lifting in mixed integer programming (Q1977865):
Displayed 14 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)