Algorithm for the solution of the assignment problem for sparse matrices
type: Item
instance of: scholarly article
title: Algorithm for the solution of the assignment problem for sparse matrices
zbMATH Open document ID: 0508.90061
DOI: 10.1007/BF02247938
published in: Computing
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3803170
zbMATH Keywords: sparse matrices
zbMATH Keywords: efficient algorithm
zbMATH Keywords: assignment problem
zbMATH Keywords: computational results
zbMATH Keywords: FORTRAN program
author: Giorgio Carpaneto
author: Paolo Toth
describes a project that uses: Algorithm 548
MaRDI profile type: Publication
cites work: Q4091421
cites work: The alternating basis algorithm for assignment problems
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: Q5519710
cites work: Q3048571
description: scientific article; zbMATH DE number 3803170