A continuous-time network simplex algorithm

DOI10.1002/net.3230190403zbMath0672.90048OpenAlexW1985873373MaRDI QIDQ3826337

Andy B. Philpott, Edward J. Anderson

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

infinite-dimensional linear programnetwork simplex algorithmarc capacitiesminimum-cost network flowflow-conservation constraintleast-cost flowupper bound constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

Inverse conic linear programs in Banach spaces, On solving continuous-time dynamic network flows, Unnamed Item, Stochastic separated continuous conic programming: strong duality and a solution method, A simplex based algorithm to solve separated continuous linear programs, Robust continuous linear programs, Flows over time in time-varying networks: optimality conditions and strong duality, Unnamed Item, Universally maximum flow with piecewise-constant capacities, A robust optimization approach to dynamic pricing and inventory control with no backorders, Time-Varying Semidefinite Programs, A simplex-type algorithm for continuous linear programs with constant coefficients, A simplex algorithm for minimum-cost network-flow problems in infinite networks, Structure of Solutions for Continuous Linear Programs with Constant Coefficients, Efficient continuous-time dynamic network flow algorithms, A greedy algorithm for finding maximum spanning trees in infinite graphs

Cites Work

• Some Properties of a Class of Continuous Linear Programs
• Unnamed Item