An adaptive discretization algorithm for a class of continuous network programs

DOI10.1002/net.3230260102zbMath0840.90064OpenAlexW2036934163MaRDI QIDQ4861343

Mark Craddock, Andy B. Philpott

Publication date: 1995

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

separated continuous linear programscontinuous-time minimum-cost network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (8)

Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions ⋮ On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Robust continuous linear programs ⋮ Perspectives on integer programming for time-dependent models ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Efficient continuous-time dynamic network flow algorithms

This page was built for publication: An adaptive discretization algorithm for a class of continuous network programs