Unimodular matrices of flow problems with additional constraints

DOI10.1002/NET.3230070406MaRDI QIDQ4152313zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• On linear systems with integral valued solutions
• On unimodular matrices
• Total unimodularity and the transportation problem: a generalization

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152313)