Algorithms and codes for dense assignment problems: The state of the art
From MaRDI portal
Publication:1962018
DOI10.1016/S0166-218X(99)00172-9zbMath0941.90046OpenAlexW2104363966MaRDI QIDQ1962018
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00172-9
Related Items
Solving the \(k\)-cardinality assignment problem by transformation, Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes, Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem, Classes of linear programs solvable by coordinate-wise minimization, A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM, On the initialization methods of an exterior point algorithm for the assignment problem, Mass transportation and the consistency of the empirical optimal conditional locations, Solving the rectangular assignment problem and applications, A branch-and-bound algorithm for the singly constrained assignment problem, A labeling algorithm for the sensitivity ranges of the assignment problem, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Worst case examples of an exterior point algorithm for the assignment problem, Tolerance-based branch and bound algorithms for the ATSP, An algorithm for ranking assignments using reoptimization, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, A dual approach to multi-dimensional assignment problems, Matching of objects nodal points improvement using optimization, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, An addendum on: ``Sensitivity analysis of the optimal assignment, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Surveys in combinatorial optimization. (Based on a series of lectures given at the School on Combinatorial Optimization, held at the Federal University of Rio de Janeiro, Brazil, July 8-19, 1985)
- Improving the Hungarian assignment algorithm
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Primal-dual algorithms for the assignment problem
- A sequential dual simplex algorithm for the linear assignment problem
- Dual coordinate step methods for linear network flow problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Parallel synchronous and asynchronous implementations of the auction algorithm
- New scaling algorithms for the assignment and minimum mean cycle problems
- A computational analysis of the auction algorithm
- A comparison of two algorithms for the assignment problem
- An efficient cost scaling algorithm for the assignment problem
- Linear and semi-assignment problems: A core oriented approach
- Linear Programming on Cray Supercomputers
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- The Hirsch Conjecture for Dual Transportation Polyhedra
- Finding Minimum-Cost Circulations by Successive Approximation
- Technical Note—A Polynomial Simplex Method for the Assignment Problem
- Signature Methods for the Assignment Problem
- On the simplex algorithm for networks and generalized networks
- A competitive (dual) simplex method for the assignment problem
- A new algorithm for the assignment problem
- The Scaling Network Simplex Algorithm
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- TSPLIB—A Traveling Salesman Problem Library
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- Technical Note—A “Hard” Assignment Problem
- A network simplex method
- The alternating basis algorithm for assignment problems
- A parallel shortest augmenting path algorithm for the assignment problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Exact solution of large-scale, asymmetric traveling salesman problems
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
