A Simplified Primal (All-Integer) Integer Programming Algorithm
From MaRDI portal
Cited in
(15)- Classical cuts for mixed-integer programming and branch-and-cut
- New technique for solving primal all-integer linear programming
- Non-standard approaches to integer programming
- On the relative complexity of 15 problems related to~0/1-integer programming
- Primal separation and approximation for the \(\{0,1/2\}\)-closure
- The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
- Integral simplex using decomposition with primal cutting planes
- Selected bibliography on degeneracy
- A surrogate cutting plane algorithm for all-integer programming
- Augmentation search for integer programming over a polyhedron
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
- A primal-like algorithm for zero-one integer Fractional Programming Problem
- An advanced start algorithm for all-integer programming
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems
This page was built for publication: A Simplified Primal (All-Integer) Integer Programming Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540132)
