Publication:3968759

Publication date: 1980

textbook; convex minimum cost flow problem; network flow; shortest path problem; maximum flow problem; network transportation; out-of-kilter algorithm; pure minimum cost flow problems; enumeration methods; network manipulation algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90B10: Deterministic network models in operations research

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT, Fuzzy shortest paths, A survey of dynamic network flows, A modeling/solution approach for optimal deployment of a weapons arsenal, The basis suppression method, Parallel arc-allocation algorithms for optimizing generalized networks, Fuzzy multicriteria integer programming via fuzzy generalized networks, Layering strategies for creating exploitable structure in linear and integer programs, A nonliner congestion network model for planning internal movement in the Hajj, The interactive fixed charge inhomogeneous flows optimization problem, Investments in stochastic maximum flow networks, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, An algorithm for optimal minimax routing in ATM networks, Solving a class of network models for dynamic flow control, Multiple items procurement under stochastic nonstationary demands, A computer-aided process planning model based on genetic algorithms, Fuzzy decision networks and deconvolution, Interactive decision support for multiobjective transportation problems, The shortest path problem with discrete fuzzy arc lengths, A new algorithm for the discrete fuzzy shortest path problem in a network, a generalized network flow model with application to power supply-demand problems, Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs, Roof duality for polynomial 0–1 optimization, A piecewise linear upper bound on the network recourse function, Solving stochastic programs with network recourse, Implementing an “exact” Newton method for separable convex transportation problems, File allocation in a distributed database, The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm