Pages that link to "Item:Q1339119"
From MaRDI portal
The following pages link to Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119):
Displaying 13 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- A hard integer program made easy by lexicography (Q715074) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Selection criteria of export equation on the cutting plane method resolving ILP problems (Q2825014) (← links)
- Solving Large-Scale Zero-One Linear Programming Problems (Q3696859) (← links)
- An improved enumeration for pure 0-1 programs (Q3978584) (← links)
- Completeness of cutting planes revisited (Q5224684) (← links)