scientific article; zbMATH DE number 53116
From MaRDI portal
Publication:4003376
zbMATH Open0754.90059MaRDI QIDQ4003376FDOQ4003376
Authors: Dimitri P. Bertsekas 
Publication date: 18 September 1992
Title of this publication is not available (Why is that?)
Recommendations
shortest pathtransportationassignmentauction algorithmtransshipmentmax-flownetwork simplex methoddual ascent approachprimal cost improvement
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)
Cited In (70)
- Stochastic downscaling method: application to wind refinement
- Fast convergence in the double oral auction
- Infinite networks: Minimal cost flows
- A case study in empty railcar distribution
- A simple and fast label correcting algorithm for shortest paths
- Transfer Graph Approach for Multimodal Transport Problems
- Solving the shortest path tour problem
- Nodal interdiction
- Rank-based testing for semiparametric VAR models: a measure transportation approach
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Title not available (Why is that?)
- A computational analysis of the auction algorithm
- Towards auction algorithms for large dense assignment problems
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Parallel asynchronous label-correcting methods for shortest paths
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach
- A forward/reverse auction algorithm for asymmetric assignment problems
- Heuristic and exact algorithms for the simultaneous assignment problem
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Single machine scheduling with symmetric earliness and tardiness penalties
- Polynomial auction algorithms for shortest paths
- Title not available (Why is that?)
- Multimodal transport network systems interface, interaction coordination: A specification for control systems integration
- Distribution network optimization: Finding the most economic solution by using genetic algorithms
- An efficient cost scaling algorithm for the assignment problem
- An approach for the network flow problem with multiple objectives
- Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Wasserstein distances in the analysis of time series and dynamical systems
- A heuristic for the continuous capacity and flow assignment
- Parallel primal-dual methods for the minimum cost flow problem
- The doubly graded matrix cone and Ferrers matrices
- Robust scheduling of metaprograms
- The vehicle rescheduling problem: Model and algorithms
- Solving the multiple competitive facilities location problem
- Mathematical programs with equilibrium constraints: A brief survey of methods and optimality conditions
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation
- A generic auction algorithm for the minimum cost network flow problem
- Title not available (Why is that?)
- An auction-based approach for the re-optimization shortest path tree problem
- Matching One Sample According to Two Criteria in Observational Studies
- The assignment problem revisited
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- Constrained balanced optimization problems
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- A linear programming approach to the optimum network orientation problem
- Algorithms for time-dependent bicriteria shortest path problems
- A multiplier adjustment technique for the capacitated concentrator location problem
- Auction dynamics: a volume constrained MBO scheme
- Network flows. Theory, algorithms, and applications.
- Parallel asynchronous algorithms for the \(K\) shortest paths problem
- Representation and management of MOEA populations based on graphs
- Maximum likelihood genetic sequence reconstruction from oligo content
- Regular random choice and the triangle inequalities
- Shortest path reoptimization vs resolution from scratch: a computational comparison
- Algorithms and codes for dense assignment problems: The state of the art
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
- Efficient parallel algorithms for the minimum cost flow problem
- An auction algorithm for the max-flow problem
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Title not available (Why is that?)
- Robust auctions for revenue via enhanced competition
- Projection methods for finding the greatest element of the intersection of max-closed convex sets
- Nonsmooth projection-free optimization with functional constraints
- The out‐of‐kilter algorithm for solving network problems
- An \(\epsilon\)-relaxation method for generalized separable convex cost network flow problems
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4003376)
