|
|||||
|
|
An efficient labeling technique for solving sparse assignment problems |
|
| Authors: | U. Derigs A. Metz |
| Affiliation: | 1. Lehrstuhl für Betriebswirtschaftslehre VII Betriebsinformatik, Universit?t Bayreuth, Postfach 101251, D-8580, Bayreuth, Germany 2. Institut für ?konometrie und Operations Research, Universit?t Bonn, Nassestrasse 2, D-5300, Bonn 1, Germany |
| Abstract: | We describe a new implementation of the shortest augmenting path approach for solving sparse assignment problems and report computational experience documenting its efficiency. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |