A continuous-time network simplex algorithm

DOI10.1002/NET.3230190403MaRDI QIDQ3826337zbMATH OpenOpenAlexFDO

Authors Edward J. Anderson, A. B. Philpott

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

arc capacitiesflow-conservation constraintinfinite-dimensional linear programleast-cost flowminimum-cost network flownetwork simplex algorithmupper bound constraints

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3934807
• Minimum cost time-varying network flow problems
• An adaptive discretization algorithm for a class of continuous network programs
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Dynamic flows in time-varying networks.

Cites work

• scientific article; zbMATH DE number 3934807 (Why is no real title available?)
• Some Properties of a Class of Continuous Linear Programs

Cited in

(30)

• Network flows with age dependent decay rates
• Efficient continuous-time dynamic network flow algorithms
• Solving a class of network models for dynamic flow control
• A path-based gradient projection algorithm for the cost-based system optimum problem in networks with continuously distributed value of time
• Stochastic separated continuous conic programming: strong duality and a solution method
• A greedy algorithm for finding maximum spanning trees in infinite graphs
• Robust continuous linear programs
• Semi-continuous network flow problems
• Flows over time in time-varying networks: optimality conditions and strong duality
• A simplex-type algorithm for continuous linear programs with constant coefficients
• A robust optimization approach to dynamic pricing and inventory control with no backorders
• Universally maximum flow with piecewise-constant capacities
• The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
• A simplex method for uncapacitated pure-supply infinite network flow problems
• scientific article; zbMATH DE number 4176802 (Why is no real title available?)
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• A forward network simplex algorithm for solving multiperiod network flow problems
• Extreme Points for Continuous Network Programs with Arc Delays
• scientific article; zbMATH DE number 617941 (Why is no real title available?)
• On solving continuous-time dynamic network flows
• The Continuous-Time Service Network Design Problem
• An adaptive discretization algorithm for a class of continuous network programs
• Continuous-time quadratic cost flow problems with applications to water distribution networks
• Time-Varying Semidefinite Programs
• A critical survey on the network optimization algorithms for evacuation planning problems
• scientific article; zbMATH DE number 2206640 (Why is no real title available?)
• Structure of solutions for continuous linear programs with constant coefficients
• Minimum spanning trees in infinite graphs: theory and algorithms
• Inverse conic linear programs in Banach spaces
• A simplex based algorithm to solve separated continuous linear programs

This page was built for publication: A continuous-time network simplex algorithm

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