Graphic matroids and the multicommodity transportation problem
From MaRDI portal
Publication:4154388
DOI10.1007/BF01584345zbMath0375.90071OpenAlexW1970204619MaRDI QIDQ4154388
James R. Evans, Richard A. Duke, John J. Jarvis
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584345
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (6)
The multicommodity assignment problem: A network aggregation heuristic ⋮ Unnamed Item ⋮ A scheduling framework for large-scale, parallel, and topology-aware applications ⋮ On equivalent representations of certain multicommodity networks as single commodity flow problems ⋮ The core of a further \(m\)-sided assignment game ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linear systems with integral valued solutions
- Total unimodularity and the transportation problem: a generalization
- On a class of equivalent systems of linear inequalities
- A Class Of Abelian Groups
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Note on Finite Convergence of Exterior Penalty Functions
- On the Abstract Properties of Linear Dependence
- On Linear Programs Equivalent to the Transportation Program
- Lectures on matroids
This page was built for publication: Graphic matroids and the multicommodity transportation problem