Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Ball M., Derigs U., Hilbrand C., Metz A. [1990]: Matching Problems with Generalized Upper Bounds Side Constraints. Networks 20, 703–721.
2. Balas E., Ho A. [1980]: Set Covering Algorithms using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study. Mathematical Programming 12, 37–60.
3. Working Paper;U Derigs,1990
4. Derigs U., Metz A. [1991]: Solving large-scale matching problems combinatorially. Mathematical Programming 50, 113–121.
5. Fisher M.L. [1981]: The Lagrangean Relaxation Method for Solving Integer Programming Problems. Management Sci. 27, 1–18.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献