A Study of General Dynamic Network Programs with Arc Time-Delays

DOI10.1137/S1052623495288180MaRDI QIDQ4376152zbMATH OpenOpenAlexFDO

Authors Malcolm C. Pullan

Publication date 10 February 1998

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623495288180

zbMATH Keywords

continuous linear programmingdualitydynamic network flowslinear optimal control

Mathematics Subject Classification ID

Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Numerical methods in optimal control (49M99) Linear optimal control problems (49N05) Duality theory (optimization) (49N15) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Extreme Points for Continuous Network Programs with Arc Delays
• scientific article; zbMATH DE number 4176802
• Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
• Scheduling unit time arc shutdowns to maximize network flow over time: complexity results
• On the analysis of optimization problems in arc-dependent networks
• Parallel arc-allocation algorithms for optimizing generalized networks
• On solving quickest time problems in time-dependent, dynamic networks
• An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
• Choosing the capacity of arcs with constraint on flow delay time
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

Cited in

(12)

• Efficient continuous-time dynamic network flow algorithms
• Stochastic separated continuous conic programming: strong duality and a solution method
• Flows over time in time-varying networks: optimality conditions and strong duality
• Universally maximum flow with piecewise-constant capacities
• Continuous-time dynamic shortest path problems with negative transit times
• scientific article; zbMATH DE number 4176802 (Why is no real title available?)
• scientific article; zbMATH DE number 3850822 (Why is no real title available?)
• FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
• Extreme Points for Continuous Network Programs with Arc Delays
• On solving continuous-time dynamic network flows
• Advances in the Continuous Dynamic Network Loading Problem
• A critical survey on the network optimization algorithms for evacuation planning problems

This page was built for publication: A Study of General Dynamic Network Programs with Arc Time-Delays

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