𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving (large scale) matching problems combinatorially

✍ Scribed by U. Derigs; A. Metz

Publisher
Springer-Verlag
Year
1991
Tongue
English
Weight
394 KB
Volume
50
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving large scale crew scheduling prob
Solving large scale crew scheduling problems
✍ Hai D. Chu; Eric Gelman; Ellis L. Johnson πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 572 KB

The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based