Linear assignment procedures

The linear assignment problem (LAP) is both useful itself as well as a relaxation for difficult conbinatorial optimization problems like quadratic assignment and the Traveling Salesman Problem. Different types of algorithms are available for LAP. An overview of the available procedures is given.

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 116; no. 1; pp. 233 - 234
Main Authors Jonker, R, Volgenant, A
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.07.1999
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Applied sciences
Core approach
Exact sciences and technology
Flows in networks. Combinatorial problems
Linear assignment
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Semi-assignment
Studies
Traveling salesman problem
Core approach
Linear assignment
Semi-assignment
Shortest path
Combinatorial optimization
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/S0377-2217(98)00361-0

Cover

More Information
Summary:The linear assignment problem (LAP) is both useful itself as well as a relaxation for difficult conbinatorial optimization problems like quadratic assignment and the Traveling Salesman Problem. Different types of algorithms are available for LAP. An overview of the available procedures is given.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(98)00361-0