Linear assignment procedures
type: Item
instance of: scholarly article
title: Linear assignment procedures
zbMATH Open document ID: 1009.90067
DOI: 10.1016/S0377-2217(98)00361-0
author: A. Volgenant
author: Roy Jonker
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1783228
zbMATH Keywords: linear assignment
zbMATH Keywords: semi-assignment
zbMATH Keywords: core approach
describes a project that uses: Turbo Pascal
MaRDI profile type: Publication
cites work: An in-core/out-of-core method for solving large scale assignment problems
cites work: An efficient cost scaling algorithm for the assignment problem
cites work: Q4283456
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
cites work: On some techniques useful for solution of transportation network problems
cites work: Linear and semi-assignment problems: A core oriented approach
full work available at URL: s0377-2217(98)00361-0
OpenAlex ID: W2058031859
description: scientific article; zbMATH DE number 1783228