Graphic matroids and the multicommodity transportation problem

DOI10.1007/BF01584345zbMATH Open0375.90071OpenAlexW1970204619MaRDI QIDQ4154388FDOQ4154388

Authors: James R. Evans, John J. Jarvis, Richard A. Duke 

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584345

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Lectures on matroids
• Title not available (Why is that?)
• A Class Of Abelian Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Abstract Properties of Linear Dependence
• Note on Finite Convergence of Exterior Penalty Functions
• On linear systems with integral valued solutions
• Total unimodularity and the transportation problem: a generalization
• On Linear Programs Equivalent to the Transportation Program
• On a class of equivalent systems of linear inequalities

Cited In (6)

• 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
• Multicommodity network flows: A survey. II: Solution methods

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)