ZIB

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Solving (large scale) matching problems combinatorially (1991)

Derigs, U. ; Metz, A.

Springer

Mathematical programming 50 (1991), S. 113-121

add to mindlist on the mindlist

Details

ISSN: 1436-4646

Keywords: Matching problem ; two-phase approach ; fast matching algorithms

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract In this paper we describe computational results for a modification of the shortest augmenting path approach for solving large scale matching problems. Using a new assignment start procedure and the two-phase strategy, where first the problem is solved on a sparse subgraph and then reoptimization is used, matching problems on complete graphs with 1000 nodes are solved in about 10–15 seconds on an IBM 4361.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01594929

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit