Increasing the Capacity of a Network: The Parametric Budget Problem

DOI10.1287/mnsc.5.4.472zbMath0995.90517OpenAlexW2024244203MaRDI QIDQ2778616

D. R. Fulkerson

Publication date: 22 October 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.5.4.472

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

A capable neural network model for solving the maximum flow problem, General flow-shop scheduling with resource constraints, Weight reduction problems with certain bottleneck objectives., A specialized network simplex algorithm for the constrained maximum flow problem, A faster polynomial algorithm for the constrained maximum flow problem, Maximizing the minimum source-sink path subject to a budget constraint, A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints, Optimal expansion of capacitated transshipment networks, An algorithm for optimizing network flow capacity under economies of scale, A parametric algorithm for convex cost network flow and related problems, Optimal expansion of an existing network