Substitutes, Complements and Ripples in Network Flows
From MaRDI portal
Publication:3698612
DOI10.1287/moor.10.3.471zbMath0577.90024OpenAlexW2061938181MaRDI QIDQ3698612
Arthur F. jun. Veinott, Frieda Granot
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.3.471
sensitivity analysissubmodular functioncomplementsseries-parallel graphsubstitutessubadditive functionlattice programmingmonotone selectionparametric algorithmripplesbiconnected graphoptimal flowsarc parametersminimum-cost network-flowsqualitative sensitivity
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
On the equivalence of constrained and unconstrained flows, Multi-leader multi-follower model with aggregative uncertainty, Nash equilibrium in games with quasi-monotonic best-responses, Optimal hierarchical clustering on a graph, Decentralized decision-making in a large team with local information., Resilience of long chain under disruption, Theory of Principal Partitions Revisited, Substitutes and Complements in Constrained Linear Models, A constructive study of Markov equilibria in stochastic games with strategic complementarities, Monotone comparative statics: geometric approach, Characterizing the performance of process flexibility structures, A qualitative approach to Markovian equilibrium in infinite horizon economies with capital, Analysis of a joint pricing and seat allocation model in a hub-to-hub airline network, Stochastic multiproduct inventory models with limited storage, Preservation of Supermodularity in Parametric Optimization: Necessary and Sufficient Conditions on Constraint Structures, Competitive Equilibrium and Trading Networks: A Network Flow Approach, Ordered optimal solutions and parametric minimum cut problems, Substitutes and complements in network flows viewed as discrete convexity
Uses Software
