A Study of General Dynamic Network Programs with Arc Time-Delays
DOI10.1137/S1052623495288180zbMATH Open0891.90163OpenAlexW2060451040MaRDI QIDQ4376152FDOQ4376152
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
Recommendations
- Extreme Points for Continuous Network Programs with Arc Delays
- Publication:3200865
- 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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) 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) Linear optimal control problems (49N05) Duality theory (optimization) (49N15) Numerical methods in optimal control (49M99)
Cited In (11)
- Extreme Points for Continuous Network Programs with Arc Delays
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
- Title not available (Why is that?)
- Continuous-time dynamic shortest path problems with negative transit times
- Flows over time in time-varying networks: optimality conditions and strong duality
- Efficient continuous-time dynamic network flow algorithms
- A critical survey on the network optimization algorithms for evacuation planning problems
- Universally maximum flow with piecewise-constant capacities
- On solving continuous-time dynamic network flows
- Title not available (Why is that?)
- Stochastic separated continuous conic programming: strong duality and a solution method
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)
