Pages that link to "Item:Q1403296"
From MaRDI portal
The following pages link to Strong formulations for mixed integer programs: valid inequalities and extended formulations (Q1403296):
Displaying 15 items.
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- Stronger formulations of mixed integer linear programs: an example (Q4378103) (← links)
- Integer Programming and Combinatorial Optimization (Q5712469) (← links)
- Strong mixed-integer formulations for the floor layout problem (Q5882271) (← links)
