A new algorithm for the assignment problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms
- The alternating basis algorithm for assignment problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(56)- Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
- 3/4-discrete optimal transport
- Repulsive assignment problem
- Optimal transport: discretization and algorithms
- Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Approximation theory, computing, and deep learning on the Wasserstein space
- Optimal matching with minimal deviation from fine balance in a study of obesity and surgical outcomes
- Towards auction algorithms for large dense assignment problems
- An in-core/out-of-core method for solving large scale assignment problems
- Contrasting evidence within and between institutions that provide treatment in an observational study of alternate forms of anesthesia
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- A Lagrangean relaxation method for the constrained assignment problem
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Satisfied two-sided matching: a method considering elation and disappointment of agents
- Auction algorithms for network flow problems: A tutorial introduction
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Bilevel biobjective pseudo Boolean programming problems
- Improving the Hungarian assignment algorithm
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- On the initialization methods of an exterior point algorithm for the assignment problem
- Resource constrained assignment problems
- Polynomial auction algorithms for shortest paths
- Bottleneck assignment problems under categorization
- A variant of time minimizing assignment problem
- Efficient dual simplex algorithms for the assignment problem
- Linear-time approximation for maximum weight matching
- Auction algorithms for market equilibrium with weak Gross substitute demands and their applications
- Algorithms for dense graphs and networks on the random access computer
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- The auction algorithm for the transportation problem
- Structured transfer function matrices and integer matrices: the computation of the generic McMillan degree and infinite zero structure
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes
- The singly constrained assignment problem: An AP basis algorithm
- A comparison of two algorithms for the assignment problem
- A new algorithm for solving a special matching problem with a general form value function under constraints
- A survey of dynamic network flows
- The invisible hand algorithm: solving the assignment problem with statistical physics
- Maximum 0-1 timed matching on temporal graphs
- Computing expectations and marginal likelihoods for permutations
- A unified framework for primal-dual methods in minimum cost network flow problems
- Primal-dual algorithms for the assignment problem
- The assignment problem under categorized jobs
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Matching methods for observational studies derived from large administrative databases
- Variable-ratio matching with fine balance in a study of the Peer Health Exchange
- A linear assignment approach for the least-squares protein morphing problem
- Massively parallel augmenting path algorithms for the assignment problem
- Using mixed integer programming for matching in an observational study of kidney failure after surgery
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Algorithms and codes for dense assignment problems: The state of the art
- Geometric metrics for topological representations
- Evaluation of subset matching methods and forms of covariate balance
- The auction algorithm: A distributed relaxation method for the assignment problem
- A time-triggered dimension reduction algorithm for the task assignment problem
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
This page was built for publication: A new algorithm for the assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911685)
