A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem

References

• Barnhart C., Johnson E. L., Nemhauser M. W., Savelsbergh P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
• Benders J. F., Keulemans W. K. M., van Nunen J. A. E. E., Stolk G., Tilanus C. B., de Gaus O. B., Lenstra J. K. A decision support program for planning locations and allocations with the aid of linear programming. Quantitative Methods in Management: Case Studies of Failures and Successes (1986) (John Wiley and Sons, Chichester, U.K) 29–34Ch. 4Google Scholar
• Cattrysse D. G., Van Wassenhove L. N. A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. (1992) 60:260–272Crossref, Google Scholar
• Cattrysse D. G., Salomon M., Van Wassenhove L. N. A set partitioning heuristic for the generalized assignment problem. Eur. J. Oper. Res. (1994) 72:167–174Crossref, Google Scholar
• Chan L. M. A., Muriel A., Simchi-Levi D. Production/distribution planning problems with piece-wise linear and concave transportation costs. (1998) . Research report, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• CPLEX Reference ManualILOG CPLEX 6.6 (1999) (ILOG, Inc., Incline Village, NV) Google Scholar
• Duran F. A large mixed integer production and distribution program. Eur. J. Oper. Res. (1987) 28:207–217Crossref, Google Scholar
• Fleischmann B. Designing distribution systems with transport economies of scale. Eur. J. Oper. Res. (1993) 70:31–42Crossref, Google Scholar
• Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20(5):822–844Link, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting-stock problem. Oper. Res. (1961) 9:849–859Link, Google Scholar
• Hall N. G., Posner M. E. Generating experimental data for scheduling problems. Oper. Res. (2001) 49(6):854–865Link, Google Scholar
• Hiriart-Urruty J. B., Lemaréchal C.Convex Analysis and Minimization Algorithms: Fundamentals (1993) 1(Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Martello S., Toth P., Brans J. P. An algorithm for the generalized assignment problem. Operational Research '81 (1981) (IFORS, North-Holland, Amsterdam, The Netherlands) 589–603Google Scholar
• Martello S., Toth P.Knapsack Problems, Algorithms and Computer Implementations (1990) (John Wiley and Sons, New York) Google Scholar
• Neebe A. W., Rao M. R. An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. (1983) 34(11):1107–1113Crossref, Google Scholar
• Osman I. H. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum (1995) 17:211–225Crossref, Google Scholar
• Rinnooy Kan A. H. G., Stougie L., Vercellis C. A class of generalized greedy algorithms for the multi-knapsack problem. Discrete Appl. Math. (1993) 42:279–290Crossref, Google Scholar
• Romeijn H. E., Piersma N. A probabilistic feasibility and value analysis of the generalized assignment problem. J. Combin. Optim. (2000) 4(3):325–355Crossref, Google Scholar
• Romeijn H. E., Romero Morales D. Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case. (1999) . Research report 99-13, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FLGoogle Scholar
• Romeijn H. E., Romero Morales D. Generating experimental data for the generalized assignment problem. Oper. Res. (2001) 49(6):866–878Link, Google Scholar
• Romeijn H. E., Romero Morales D. An asymptotically optimal greedy heuristic for the multi-period single-sourcing problem: The cyclic case. Naval Res. Logist. (2003) 50(5):412–437Crossref, Google Scholar
• Romero Morales D. Optimization problems in supply chain management. (2000) . Ph.D. thesis, TRAIL Thesis Series no. 2000/4 & ERIM Ph.D. Series Research in Management, No. 3. Rotterdam, The NetherlandsGoogle Scholar
• Savelsbergh M. W. P. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. (1997) 45(6):831–841Link, Google Scholar
• Srinivasan V., Thompson G. L. An algorithm for assigning uses to sources in a special class of transportation problems. Oper. Res. (1972) 21:284–295Link, Google Scholar
• Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. (2000) 48(1):111–128Link, Google Scholar