An efficient labeling technique for solving sparse assignment problems (Q1071650): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Signature Methods for the Assignment Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm for the solution of the assignment problem for sparse matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recent Developments in Computer Implementation Technology for Network Flow Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Assignment Problem by Relaxation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5519710 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Recursive Method for Solving Assignment Problems / rank | |||
Normal rank | |||
Latest revision as of 11:55, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient labeling technique for solving sparse assignment problems |
scientific article |
Statements
An efficient labeling technique for solving sparse assignment problems (English)
0 references
1986
0 references
We describe a new implementation of the shortest augmenting path approach for solving sparse assignment problems and report computational experience documenting its efficiency.
0 references
implementation
0 references
shortest augmenting path
0 references
sparse assignment
0 references
computational experience
0 references
