A matching approach for replenishing rectangular stock sizes
暂无分享,去创建一个
[1] Ulrich Derigs,et al. A shortest augmenting path method for solving minimal perfect matching problems , 1981, Networks.
[2] Francis J. Vasko,et al. A Practical Approach for Determining Rectangular Stock Sizes , 1994 .
[3] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[4] Francis J. Vasko,et al. Bethlehem steel combines cutting stock and set covering to enhance customer service , 1992 .
[5] Ulrich Derigs,et al. Solving (large scale) matching problems combinatorially , 1991, Math. Program..
[6] Mikael Rönnqvist,et al. Aircrew schedule generation using repeated matching , 1997 .
[7] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .
[8] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[9] Ulrich Derigs,et al. Solving non-bipartite matching problems via shortest path techniques , 1988 .
[10] Cynthia Barnhart,et al. Routing models and solution procedures for regional less-than-truckload operations , 1995, Ann. Oper. Res..