A survey of dynamic network flows
From MaRDI portal
Publication:917417
DOI10.1007/BF02216922zbMath0704.90028MaRDI QIDQ917417
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), Flows in strongly regular periodic dynamic resource networks, Solving a class of network models for dynamic flow control, Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Minmax regret for sink location on dynamic flow paths with general capacities, Graceful reassignment of excessively long communications paths in networks, Multicommodity flows over time: Efficient algorithms and complexity, Flows in dynamic networks with aggregate arc capacities, On the motion of substance in a channel of a network and human migration, Minimum parametric flow in time-dependent dynamic networks, Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration, Resource downgrading, Pricing and balancing of the sea-cargo service chain with empty equipment repositioning, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks, Statistical distributions connected to motion of substance in a channel of a network, A model-based approach and analysis for multi-period networks, Continuous dynamic contraflow approach for evacuation planning, Efficient continuous contraflow algorithms for evacuation planning problems, Single source single-commodity stochastic network design, Allocation of empty containers between multi-ports, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, Minimum cost dynamic flows: The series-parallel case, Metaheuristics for the work‐troops scheduling problem, The quickest flow problem, A note on the quickest minimum cost transshipment problem, Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows, Temporal flows in temporal networks, Branch-and-cut for a 2-commodity flow relocation model with time constraints, Pattern-based evacuation planning for urban areas, The Maximum Energy-Constrained Dynamic Flow Problem, Optimal egress time calculation and path generation for large evacuation networks, Continuous and discrete flows over time, Determining the optimal flows in zero-time dynamic networks, An Introduction to Network Flows over Time, Dynamic graph generation for the shortest path problem in time expanded networks, Algorithms for Finding Optimal Flows in Dynamic Networks, Facets of the Stochastic Network Flow Problem, On solving continuous-time dynamic network flows, Nash equilibria and the price of anarchy for flows over time, Unnamed Item, Unnamed Item, An introduction to dynamic generative networks: minimum cost flow, On solving maximum and quickest interval-valued flows over time, A polynomial time algorithm for the minimum flow problem in time-varying networks, Computational complexity of convoy movement planning problems, Lot sizing with inventory gains, Truck dock assignment problem with operational time constraint within crossdocks, Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, Minimum flow problem on network flows with time-varying bounds, Universally maximum flow with piecewise-constant capacities, A heuristic algorithm for the earliest arrival flow with multiple sources, Maximum flow problem on dynamic generative network flows with time-varying bounds, Robust flows over time: models and complexity results, A minmax regret version of the time-dependent shortest path problem, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, Partial contraflow with path reversals for evacuation planning, A survey on models and algorithms for discrete evacuation planning network problems, Unnamed Item, Traffic Networks and Flows over Time, One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints, On the motion of substance in a channel and growth of random networks, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, Iterative improvement methods for a multiperiod network design problem, Heterogeneous multi-commodity network flows over time, Efficient continuous-time dynamic network flow algorithms, Abstract network flow with intermediate storage for evacuation planning, Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters, A tabu search heuristic procedure for the fixed charge transportation problem, A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario, Optimization and sustainable development
Uses Software
Cites Work
- Converting Linear Programs to Network Problems
- Bounds for aggregating nodes in network problems
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Cyclic Scheduling via Integer Programs with Circular Ones
- Analytical Models In Rail Transportation: An Annotated Bibliography
- A new algorithm for the assignment problem
- The Multiregion Dynamic Capacity Expansion Problem, Part I
- A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- Using Linear Programming to Derive Planning Horizons for a Production Smoothing Problem
- The simplex SON algorithm for LP/embedded network problems
- The general multimodal network equilibrium problem with elastic demand
- A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- A Class of Continuous Network Flow Problems
- Heuristics for Multistage Production Planning Problems
- An Algorithm for the Three-Index Assignment Problem
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- A bilinear programming formulation of the 3-dimensional assignment problem
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
- Maximal, Lexicographic, and Dynamic Network Flows
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- A network simplex method
- A generalized upper bounding approach to a communications network planning problem
- Deterministic network optimization: A bibliography
- An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- On building minimum cost communication networks
- A Survey of Linear Cost Multicommodity Network Flows
- The alternating basis algorithm for assignment problems
- An algorithm for nonlinear multicommodity flow problems
- Multicommodity network flows—A survey
- Unnetworks, with Applications to Idle Time Scheduling
- Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- A generalized dynamic flows problem
- Theoretical Properties of the Network Simplex Method
- Decision and forecast horizons in a stochastic environment: A survey
- A general dynamic spatial price network equilibrium model with gains and losses
- Planning horizon procedures for machine replacement models with several possible replacement alternatives
- A Reduced Gradient Algorithm for Nonlinear Network Problems
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Dynamic network flows with arc changes
- On building minimum cost communication networks over time
- Shortest path with time constraints on movement and parking
- Min/max bounds for dynamic network flows
- Augmented Threaded Index Method For Network Optimization
- The pivot and probe algorithm for solving a linear program
- The Routing Problem with “K” Specified Nodes
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Minimum Concave Cost Flows in Certain Networks
- Letter to the Editor—The Multidimensional Assignment Problem
- Letter to the Editor—On the Necessary Conditions for the Existence of the Solution of the Multi-Index Transportation Problem
- An Appraisal of Some Shortest-Path Algorithms
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
- Traffic assignment problem for a general network
- Minimum cost routing for static network models
- The steiner problem in graphs
- Optimal Scheduiing of Two Consecutive Idle Periods
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
- Generalized multi‐stage connection networks
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Minimum cost routing for dynamic network models
- The Multi-Index Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Traffic assignment in communication satellites
- A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
- A new polynomial-time algorithm for linear programming
- A theorem on flows in networks
- The tridiagonal transportation problem
- Network reoptimization procedures for multiobjective network problems
- Solution of large dense transportation problems using a parallel primal algorithm
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Representing inverses in pure network flow optimization
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- A forward convex-simplex method
- Modeling of building evacuation problems by network flows with side constraints
- A distributed algorithm for convex network optimization problems
- Exploiting special structure in Karmarkar's linear programming algorithm
- Computing Karmarkar projections quickly
- The equal flow problem
- A general dynamic spatial price equilibrium model: Formulation, solution, and computational results
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- Congested network flows: Time-varying demands and start-time policies
- Minimum concave cost production system: A further generalization of multi-echelon model
- Dual coordinate step methods for linear network flow problems
- Parallel optimization for traffic assignment
- Vectorization and multitasking of nonlinear network programming algorithms
- Layering strategies for creating exploitable structure in linear and integer programs
- Transient flows in networks
- The multicommodity assignment problem: A network aggregation heuristic
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- The generalized alternating path algorithm for transportation problems
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- Complexity of a 3-dimensional assignment problem
- Facets of the three-index assignment polytope
- The shortest route through a network with time-dependent internodal transit times
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A Dynamic Space-Time Network Flow Model for City Traffic Congestion
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Dynamic Marketing, Storage and Transportation System with Perfect Competition in Each of Its Markets
- Universal Planning Horizons for Generalized Convex Production Scheduling
- Maximal Flow Through a Network
- Automatic identification of embedded network rows in large-scale optimization models
- Sensitivity analysis for the asymmetric network equilibrium problem
- Duality and an Algorithm for a Class of Continuous Transportation Problems
- Optimal dynamic routing in communication networks with continuous traffic
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- A Transportation Type Aggregate Production Model with Backordering
- An improved disaggregation method for transportation problems
- Maximum-throughput dynamic network flows
- A dynamic marketing network with monopsonistic acquisition and perfectly competitive disposition
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- Sensitivity Analysis for the General Spatial Economic Equilibrium Problem
- Solving Large Scale Generalized Networks
- A unified framework for primal-dual methods in minimum cost network flow problems
- Minimum Convex Cost Dynamic Network Flows
- Extracting embedded generalized networks from linear programming problems
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
- Optimal inventory, backlogging and machine loading in a serial, multi-stage, multi-period production environment
- Minimal forecast horizon procedures for dynamic lot size models
- A forward network simplex algorithm for solving multiperiod network flow problems
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
- End effects in capacity expansion models with finite horizons
- A Primal Simplex Approach to Pure Processing Networks
- A Forward Simplex Method for Staircase Linear Programs
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- Piecewise-linear programming: The compact (CPLP) algorithm
- Eliminating Inventory in a Series Facility Production System
- Optimal Time-Varying Flows on Congested Networks
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- From EOQ Towards ZI
- Aggregation in Dynamic Programming
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Relaxation Methods for Linear Programs
- Mitigating End Effects in the Dynamic Vehicle Allocation Model
- On the use of lexicographic min cost flows in evacuation modeling
- Dual Algorithms for Pure Network Problems
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- New Methods in Mathematical Programming—The Solid Transportation Problem
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Optimal Capacity Scheduling—I
- Planning Horizon Procedures for Machine Replacement Models
- A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
- The dynamic transportation problem: A survey
