Unimodular matrices of flow problems with additional constraints

DOI10.1002/net.3230070406zbMath0373.90023OpenAlexW2067018439MaRDI QIDQ4152313

Klaus Truemper

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070406

Mathematics Subject Classification ID

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

Related Items (8)

Single Commodity Representation of Multicommodity Networks ⋮ Modeling of building evacuation problems by network flows with side constraints ⋮ Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms ⋮ Complement total unimodularity ⋮ The multicommodity assignment problem: A network aggregation heuristic ⋮ Unnamed Item ⋮ A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory ⋮ Avoiding bad steps in Frank-Wolfe variants

Cites Work

• Unnamed Item
• On linear systems with integral valued solutions
• Total unimodularity and the transportation problem: a generalization
• Generalized upper bounding techniques
• On unimodular matrices

This page was built for publication: Unimodular matrices of flow problems with additional constraints