Substitutes and complements in network flow problems

DOI10.1016/0166-218X(81)90014-7MaRDI QIDQ1151332zbMATH OpenOpenAlexFDO

Authors David Gale, Themistocles Politof

Publication date 1981

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(81)90014-7

zbMATH Keywords

transportationcomplementsnetwork flow problemssubstitutesfunction of several variablescombinatorial criterion for arcsmaximum weight circulationoptimal assignment problemsparallel arcsseries arcssubstitutive function arguments

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• On network flow functions

Cited in

(6)

• Substitutes and Complements in Constrained Linear Models
• Complements and substitutes among locations in the two-stage transshipment problem
• Substitutes and complements in network flows viewed as discrete convexity
• Structural properties in a hub-to-hub network revenue management problem
• Resilience of long chain under disruption
• Preservation of supermodularity in parametric optimization: necessary and sufficient conditions on constraint structures

This page was built for publication: Substitutes and complements in network flow problems

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