An efficient cost scaling algorithm for the assignment problem
From MaRDI portal
Publication:1914072
DOI10.1007/BF01585996zbMATH Open0846.90118OpenAlexW1981020230MaRDI QIDQ1914072FDOQ1914072
Authors: Yanyan Li 
Publication date: 3 October 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585996
Recommendations
assignment problemexperimental evaluationcost scalingcost scaling push-related methodminimum-cost flow problems
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- The auction algorithm: A distributed relaxation method for the assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster Scaling Algorithms for Network Problems
- Finding Minimum-Cost Circulations by Successive Approximation
- A new approach to the maximum-flow problem
- Improved Algorithms for Bipartite Network Flow
- Title not available (Why is that?)
- Global Price Updates Help
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (25)
- Optimum matchings in weighted bipartite graphs
- Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
- A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem
- Multiscale edge detection using first-order derivative of anisotropic Gaussian kernels
- Towards auction algorithms for large dense assignment problems
- New scaling algorithms for the assignment and minimum mean cycle problems
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- Classes of linear programs solvable by coordinate-wise minimization
- Reducing rank-maximal to maximum weight matching
- Title not available (Why is that?)
- On the role of distance transformations in Baddeley's delta metric
- Exact solution of emerging quadratic assignment problems
- The assignment problem revisited
- AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
- Title not available (Why is that?)
- Coarse graining of multiple water molecules with intelligent dissipative particle dynamics
- Solving the rectangular assignment problem and applications
- A framework for edge detection based on relief functions
- Linear assignment procedures
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Algorithms and codes for dense assignment problems: The state of the art
Uses Software
This page was built for publication: An efficient cost scaling algorithm for the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914072)
