Pages that link to "Item:Q1977865"
From MaRDI portal
The following pages link to Sequence independent lifting in mixed integer programming (Q1977865):
Displaying 19 items.
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- Sequence Independent Lifting for Mixed-Integer Programming (Q3637441) (← links)
- Sequence Independent Lifting for the Set of Submodular Maximization Problem (Q5041759) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
