Improved penalties for fixed cost linear programs using Lagrangean relaxation
暂无分享,去创建一个
[1] J. Kennington,et al. A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem , 1976 .
[2] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[3] Fred W. Glover,et al. A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..
[4] M. Balinski. Fixed‐cost transportation problems , 1961 .
[5] Norman J. Driebeek. An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .
[6] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .
[7] John A. Tomlin,et al. Technical Note - An Improved Branch-and-Bound Method for Integer Programming , 1971, Oper. Res..
[8] Paul Gray,et al. Technical Note - Exact Solution of the Fixed-Charge Transportation Problem , 1971, Oper. Res..
[9] A. M. Geoffrion,et al. Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .
[10] A. Victor Cabot,et al. Some branch‐and‐bound procedures for fixed‐cost transportation problems , 1984 .