Page cuts for integer interval linear programming
From MaRDI portal
Publication:754756
Cites work
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- A finiteness proof for modified dantzig cuts in integer programming
- A suboptimization method for interval linear programming: A new method for linear programming
- An Algorithm for Solving Interval Linear Programming Problems
- An Explicit Solution of a Special Class of Linear Programming Problems
- Optimality and Degeneracy in Linear Programming
- Technical Note—Strengthened Dantzig Cuts for Integer Programming
- Trivial integer programs unsolvable by branch-and-bound
Cited in
(3)
This page was built for publication: Page cuts for integer interval linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754756)