scientific article

Publication date: 18 September 1992

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

transportation shortest path assignment auction algorithm transshipment max-flow network simplex method dual ascent approach primal cost improvement

Mathematics Subject Classification ID

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

Related Items

Representation and management of MOEA populations based on graphs ⋮ A computational analysis of the auction algorithm ⋮ Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ The assignment problem revisited ⋮ Towards auction algorithms for large dense assignment problems ⋮ Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation ⋮ Matching One Sample According to Two Criteria in Observational Studies ⋮ Unnamed Item ⋮ Fast Convergence in the Double Oral Auction ⋮ An auction algorithm for the max-flow problem ⋮ Multimodal transport network systems interface, interaction coordination: A specification for control systems integration ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ A simple and fast label correcting algorithm for shortest paths ⋮ An efficient cost scaling algorithm for the assignment problem ⋮ An approach for the network flow problem with multiple objectives ⋮ Efficient parallel algorithms for the minimum cost flow problem ⋮ Infinite networks: Minimal cost flows ⋮ Maximum likelihood genetic sequence reconstruction from oligo content ⋮ A case study in empty railcar distribution ⋮ Wasserstein distances in the analysis of time series and dynamical systems ⋮ The doubly graded matrix cone and Ferrers matrices ⋮ Nodal interdiction ⋮ A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods ⋮ Auction dynamics: a volume constrained MBO scheme ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Constrained balanced optimization problems ⋮ The out‐of‐kilter algorithm for solving network problems ⋮ Parallel asynchronous algorithms for the \(K\) shortest paths problem ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING ⋮ Stochastic downscaling method: application to wind refinement ⋮ A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem ⋮ Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem ⋮ The vehicle rescheduling problem: Model and algorithms ⋮ Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation ⋮ Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach ⋮ A forward/reverse auction algorithm for asymmetric assignment problems ⋮ Polynomial auction algorithms for shortest paths ⋮ Transfer Graph Approach for Multimodal Transport Problems ⋮ Robust Auctions for Revenue via Enhanced Competition ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ Heuristic and exact algorithms for the simultaneous assignment problem ⋮ Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions ⋮ Distribution network optimization: Finding the most economic solution by using genetic algorithms ⋮ Regular random choice and the triangle inequalities ⋮ Solving the multiple competitive facilities location problem ⋮ Robust scheduling of metaprograms ⋮ A multiplier adjustment technique for the capacitated concentrator location problem ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ A generic auction algorithm for the minimum cost network flow problem ⋮ Parallel primal-dual methods for the minimum cost flow problem ⋮ Rank-based testing for semiparametric VAR models: a measure transportation approach ⋮ Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking ⋮ Single machine scheduling with symmetric earliness and tardiness penalties ⋮ A heuristic for the continuous capacity and flow assignment ⋮ Solving the shortest path tour problem ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem