A fast and simple branching algorithm for solving small scale fixed-charge transportation problem

Hirsch, 1968, The fixed charge problem, Nav Res Logist Q, 15, 413, 10.1002/nav.3800150306 Steinberg, 1970, The fixed charge problem, Nav Res Logist Q, 17, 217, 10.1002/nav.3800170209 Adlakha, 2006, Heuristic algorithms for the fixed-charge transportation problem, OPSEARCH, 43, 88, 10.1007/BF03398770 Aguado, 2009, Fixed charge transportation problems: a new heuristic approach based on lagrangean relaxation and the solving of core problems, Ann Oper Res, 172, 45, 10.1007/s10479-008-0483-2 Cooper, 1975, The fixed charge problem - i: a new heuristic method, Comput Math Appl, 1, 89, 10.1016/0898-1221(75)90010-3 Cooper, 1967, An approximate algorithm for the fixed charge problem, Nav Res Logist Q, 14, 101, 10.1002/nav.3800140110 Glover, 2005, Parametric ghost image processes for fixed charge problems: a study of transportation networks, J Heuristics, 11, 307, 10.1007/s10732-005-2135-x Murty, 1968, Solving the fixed charge problem by ranking the extreme points, Oper Res, 16, 268, 10.1287/opre.16.2.268 Sadagopan, 1982, A vertex ranking algorithm for the fixed-charge transportation problem, J Optim Theory Appl, 37, 221, 10.1007/BF00934768 Sun, 1998, A tabu search heuristic procedure for the fixed charge transportation problem, Eur J Oper Res, 106, 441, 10.1016/S0377-2217(97)00284-1 Caramia, 2009, A heuristic approach to long-haul freight transportation with multiple objective functions, OMEGA-Int J Manag Sci, 37, 600, 10.1016/j.omega.2008.02.001 Dell’Amico, 2014, The bike sharing rebalancing problem: mathematical formulations and benchmark instances, OMEGA-Int J Manag Sci, 45, 7, 10.1016/j.omega.2013.12.001 Li, 2008, Truck scheduling for solid waste collection in the city of Porto Alegre, Brazil, OMEGA-Int J Manag Sci, 36, 1133, 10.1016/j.omega.2006.04.007 Ortega, 2003, A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem, Networks, 41, 143, 10.1002/net.10068 Palekar, 1990, A branch-and-bound method for the fixed charge transportation problem, Manag Sci, 36, 1092, 10.1287/mnsc.36.9.1092 Qin, 2012, The freight allocation problem with all-units quantity-based discount: a heuristic algorithm, OMEGA-Int J Manag Sci, 40, 415, 10.1016/j.omega.2011.05.005 Walker, 1976, A heuristic adjacent extreme point algorithm for the fixed charge problem, Manag Sci, 22, 587, 10.1287/mnsc.22.5.587 Adlakha, 2014, On approximation of the fixed charge transportation problem, OMEGA-Int J Manag Sci, 43, 64, 10.1016/j.omega.2013.06.005 Adlakha, 2010, A branching method for the fixed charge transportation problem, OMEGA-Int J Manag Sci, 38, 393, 10.1016/j.omega.2009.10.005 Balinski, 1961, Fixed cost transportation problems, Nav Res Logist Q, 8, 41, 10.1002/nav.3800080104 Kowalski, 2005, On the structure of the fixed charge transportation problem, Internat J Math Ed Sci Tech, 36, 879, 10.1080/00207390500137837 Kowalski, 2007, New approach to fixed charges problems (FCP), Int J Manag Sci Eng Manag, 2, 75 Adlakha, 2003, A simple heuristic for solving small fixed-charge transportation problems, OMEGA-Int J Manag Sci, 31, 205, 10.1016/S0305-0483(03)00025-2 Lev, 2011, Modeling fixed-charge problems with polynomials, OMEGA-Int J Manag Sci, 39, 725, 10.1016/j.omega.2011.02.006