Graphic matroids and the multicommodity transportation problem
From MaRDI portal
Publication:4154388
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3121294 (Why is no real title available?)
- scientific article; zbMATH DE number 3167398 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- A Class Of Abelian Groups
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Lectures on matroids
- Note on Finite Convergence of Exterior Penalty Functions
- On Linear Programs Equivalent to the Transportation Program
- On a class of equivalent systems of linear inequalities
- On linear systems with integral valued solutions
- On the Abstract Properties of Linear Dependence
- Total unimodularity and the transportation problem: a generalization
Cited in
(6)- Multicommodity network flows: A survey. II: Solution methods
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- The core of a further m-sided assignment game
- A scheduling framework for large-scale, parallel, and topology-aware applications
- On equivalent representations of certain multicommodity networks as single commodity flow problems
- The multicommodity assignment problem: A network aggregation heuristic
This page was built for publication: Graphic matroids and the multicommodity transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154388)