A new algorithm for the assignment problem
From MaRDI portal
Publication:3911685
DOI10.1007/BF01584237zbMath0461.90069MaRDI QIDQ3911685
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
algorithmcomputational complexitynetwork flowsassignment problemcomparison of algorithmsHungarian methodrandomly generated problems
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
Efficient dual simplex algorithms for the assignment problem, Improving the Hungarian assignment algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, A Lagrangean relaxation method for the constrained assignment problem, Satisfied two-sided matching: a method considering elation and disappointment of agents, The invisible hand algorithm: solving the assignment problem with statistical physics, Towards auction algorithms for large dense assignment problems, Primal-dual algorithms for the assignment problem, Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes, Linear-Time Approximation for Maximum Weight Matching, Bilevel biobjective pseudo Boolean programming problems, Massively parallel augmenting path algorithms for the assignment problem, The singly constrained assignment problem: An AP basis algorithm, Maximum 0-1 timed matching on temporal graphs, The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching, Algorithms for dense graphs and networks on the random access computer, An in-core/out-of-core method for solving large scale assignment problems, Semi-discrete optimal transport: hardness, regularization and numerical solution, Multiplicative auction algorithm for approximate maximum weight bipartite matching, On the initialization methods of an exterior point algorithm for the assignment problem, Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces, Discrete Optimal Transport with Independent Marginals is #P-Hard, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, Stronger instruments via integer programming in an observational study of late preterm birth outcomes, A survey of dynamic network flows, The auction algorithm for the transportation problem, A linear assignment approach for the least-squares protein morphing problem, Algorithms and codes for dense assignment problems: The state of the art, Matching methods for observational studies derived from large administrative databases, Structured transfer function matrices and integer matrices: the computation of the generic McMillan degree and infinite zero structure, Geometric Metrics for Topological Representations, 3/4-Discrete Optimal Transport, Optimal transport: discretization and algorithms, Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery, Contrasting Evidence Within and Between Institutions That Provide Treatment in an Observational Study of Alternate Forms of Anesthesia, A genuinely polynomial primal simplex algorithm for the assignment problem, Auction algorithms for network flow problems: A tutorial introduction, Repulsive assignment problem, Empirical optimal transport on countable metric spaces: distributional limits and statistical applications, A new algorithm for solving a special matching problem with a general form value function under constraints, A comparison of two algorithms for the assignment problem, Polynomial auction algorithms for shortest paths, Resource constrained assignment problems, Bottleneck assignment problems under categorization, Computing expectations and marginal likelihoods for permutations, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, The assignment problem under categorized jobs, A variant of time minimizing assignment problem, A time-triggered dimension reduction algorithm for the task assignment problem, A unified framework for primal-dual methods in minimum cost network flow problems, The auction algorithm: A distributed relaxation method for the assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- The alternating basis algorithm for assignment problems
