Flows in Arborescences
From MaRDI portal
Cited in
(8)- An efficient algorithm for solving a special class of LP's
- An algorithm for solving a structured class of linear programming problems
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- Multi-index transportation problems with 1-nested structure
- Logical processing for integer programming
- Exploiting nested inequalities and surrogate constraints
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
This page was built for publication: Flows in Arborescences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5638140)