An in-core/out-of-core method for solving large scale assignment problems (Q3763916): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new algorithm 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: An efficient labeling technique for solving sparse assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The zero pivot phenomenon in transportation and assignment problems and its computational implications / rank | |||
Normal rank | |||
Latest revision as of 12:45, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An in-core/out-of-core method for solving large scale assignment problems |
scientific article |
Statements
An in-core/out-of-core method for solving large scale assignment problems (English)
0 references
1986
0 references
matching
0 references
shortest augmenting path
0 references
assignment problem
0 references
large bipartite graphs
0 references
sparse subgraph
0 references
outpricing/reoptimization
0 references
