Series parallel composition of greedy linear programming problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3970528 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- scientific article; zbMATH DE number 3272833 (Why is no real title available?)
- Classes of linear programs with integral optimal solutions
- Greedy concepts for network flow problems
- Minimum cost flow algorithms for series-parallel networks
- On greedy algorithms for series parallel graphs
Cited in
(9)- Greedy concepts for network flow problems
- What the transportation problem did for me
- Greedy packing and series-parallel graphs
- Some recent results in the analysis of greedy algorithms for assignment problems
- Integrality in the multinetwork min‐cost equal‐flow problem
- Perspectives of Monge properties in optimization
- A Monge property for the \(d\)-dimensional transportation problem
- Generalized max flow in series-parallel graphs
- scientific article; zbMATH DE number 3970528 (Why is no real title available?)
This page was built for publication: Series parallel composition of greedy linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321658)