scientific article

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (43)

File allocation in a distributed database ⋮ The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm ⋮ Solving a class of network models for dynamic flow control ⋮ Interactive decision support for multiobjective transportation problems ⋮ Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network ⋮ Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability ⋮ Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs ⋮ Fuel and energy system control at large-scale damages. I: Network model and software implementation ⋮ A computer-aided process planning model based on genetic algorithms ⋮ Layering strategies for creating exploitable structure in linear and integer programs ⋮ A nonliner congestion network model for planning internal movement in the Hajj ⋮ Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Multiple items procurement under stochastic nonstationary demands ⋮ Roof duality for polynomial 0–1 optimization ⋮ A piecewise linear upper bound on the network recourse function ⋮ Quantitative analysis of flow distributions in a multiuser telecommunication network ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network ⋮ Analysis of cluster damages in network systems ⋮ Solving stochastic programs with network recourse ⋮ 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 decision networks and deconvolution ⋮ The interactive fixed charge inhomogeneous flows optimization problem ⋮ Investments in stochastic maximum flow networks ⋮ Analysis of critical damage in the communication network. III: Analysis of internode flows ⋮ Implementing an “exact” Newton method for separable convex transportation problems ⋮ Analysis of critical damage in the communication network. II: Guaranteed functional performance estimates ⋮ a generalized network flow model with application to power supply-demand problems ⋮ The shortest path problem with discrete fuzzy arc lengths ⋮ A new algorithm for the discrete fuzzy shortest path problem in a network ⋮ An approach to the analysis of possible structural damages in multicommodity network systems ⋮ Fuel and energy system control at large-scale damages. II: Optimization problems ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT ⋮ Fuel and energy system control at large-scale damages. IV: A priori estimates of structural and functional vulnerability ⋮ Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system ⋮ Fuzzy multicriteria integer programming via fuzzy generalized networks ⋮ Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems ⋮ Fuzzy shortest paths ⋮ An algorithm for optimal minimax routing in ATM networks

This page was built for publication: