A bounded dual (all-integer) integer programming algorithm with an objective cut
From MaRDI portal
Recommendations
- A primal-dual cutting-plane algorithm for all-integer programming
- The mixed cutting plane algorithm for all-integer programming
- Dual network bounds for integer programming problems of a special form
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- scientific article; zbMATH DE number 3908170
Cites work
Cited in
(11)- Solution approaches for highly primal- and dual-degenerate all-integer programming problems
- An advanced start algorithm for all-integer programming
- A surrogate cutting plane algorithm for all-integer programming
- The mixed cutting plane algorithm for all-integer programming
- Dual network bounds for integer programming problems of a special form
- A monotonic, dual-based bounding procedure for integer programs
- A primal-dual cutting-plane algorithm for all-integer programming
- scientific article; zbMATH DE number 3856824 (Why is no real title available?)
- scientific article; zbMATH DE number 3948005 (Why is no real title available?)
- scientific article; zbMATH DE number 5257230 (Why is no real title available?)
- Commission strategy of the auction house
This page was built for publication: A bounded dual (all-integer) integer programming algorithm with an objective cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316963)