Algorithms and codes for dense assignment problems: The state of the art
type: Item
instance of: scholarly article
title: Algorithms and codes for dense assignment problems: The state of the art
zbMATH Open document ID: 0941.90046
DOI: 10.1016/S0166-218X(99)00172-9
author: Mauro Dell'Amico
author: Paolo Toth
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1394989
zbMATH Keywords: linear assignment problem
zbMATH Keywords: experimental evaluation
zbMATH Keywords: comparison of algorithms
zbMATH Keywords: dense matrices
describes a project that uses: OR-Library
describes a project that uses: TSPLIB
describes a project that uses: VRP
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: The Scaling Network Simplex Algorithm
cites work: A sequential dual simplex algorithm for the linear assignment problem
cites work: Q4035633
cites work: A genuinely polynomial primal simplex algorithm for the assignment problem
cites work: A parallel shortest augmenting path algorithm for the assignment problem
cites work: The Hirsch Conjecture for Dual Transportation Polyhedra
cites work: Signature Methods for the Assignment Problem
cites work: A competitive (dual) simplex method for the assignment problem
cites work: The alternating basis algorithm for assignment problems
cites work: Linear Programming on Cray Supercomputers
cites work: A new algorithm for the assignment problem
cites work: Q4003376
cites work: Dual coordinate step methods for linear network flow problems
cites work: Parallel synchronous and asynchronous implementations of the auction algorithm
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Exact solution of large-scale, asymmetric traveling salesman problems
cites work: Primal-dual algorithms for the assignment problem
cites work: Q4276004
cites work: Q3048611
cites work: A network simplex method
cites work: Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
cites work: Q4382664
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: An efficient cost scaling algorithm for the assignment problem
cites work: Sublinear-Time Parallel Algorithms for Matching and Related Problems
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem
cites work: Improving the Hungarian assignment algorithm
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
cites work: Q5519710
cites work: Q5519711
cites work: Q3048571
cites work: Technical Note—A “Hard” Assignment Problem
cites work: 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)
cites work: Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
cites work: On the simplex algorithm for networks and generalized networks
cites work: New scaling algorithms for the assignment and minimum mean cycle problems
cites work: Q4739657
cites work: Q4283454
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A computational analysis of the auction algorithm
cites work: Q3994373
cites work: Linear and semi-assignment problems: A core oriented approach
cites work: A comparison of two algorithms for the assignment problem
full work available at URL: s0166-218x(99)00172-9
OpenAlex ID: W2104363966
description: scientific article; zbMATH DE number 1394989