Pages that link to "Item:Q1121789"
From MaRDI portal
The following pages link to Strong formulations for mixed integer programming: A survey (Q1121789):
Displaying 17 items.
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- Long range planning in the process industries: A projection approach (Q1919201) (← links)
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- Stronger formulations of mixed integer linear programs: an example (Q4378103) (← links)
- Strong mixed-integer formulations for the floor layout problem (Q5882271) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
