Narrow search
Showing 1 - 10 of 647
Cover Image
A network flow model for the optimal allocation of both foldable and standard containers
Myung, Young-soo; Moon, Ilkyeong - In: Operations research letters 42 (2014) 6/7, pp. 484-488
Persistent link: https://www.econbiz.de/10010428029
Cover Image
A hybrid genetic algorithm for the repetition free longest common subsequence problem
Castelli, Mauro; Beretta, Stefano; Vanneschi, Leonardo - In: Operations research letters 41 (2013) 6, pp. 644-649
Persistent link: https://www.econbiz.de/10010236062
Cover Image
Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves
Castelli, Mauro; Vanneschi, Leonardo - In: Operations research letters 42 (2014) 5, pp. 355-360
Persistent link: https://www.econbiz.de/10010404383
Cover Image
A note on the MIR closure
Bonami, Pierre; Cornuéjols, Gérard - In: Operations research letters 36 (2008) 1, pp. 4-6
Persistent link: https://www.econbiz.de/10003768446
Cover Image
An inverse model for the most uniform problem
Wang, Qin; Yuan, Jinjiang; Zhang, Jianzhong - In: Operations research letters 36 (2008) 1, pp. 26-30
Persistent link: https://www.econbiz.de/10003768462
Cover Image
Identifying the optimal partition in convex quadratic programming
Wright, Stephen E. - In: Operations research letters 36 (2008) 1, pp. 67-70
Persistent link: https://www.econbiz.de/10003768520
Cover Image
The solution set structure of monotone linear complementarity problems over second-order cone
Kong, Lingchen; Xiu, Naihua; Han, Jiye - In: Operations research letters 36 (2008) 1, pp. 71-76
Persistent link: https://www.econbiz.de/10003768522
Cover Image
On test sets for nonlinear integer maximization
Lee, Jon; Onn, Shmuel; Weismantel, Robert - In: Operations research letters 36 (2008) 4, pp. 439-443
Persistent link: https://www.econbiz.de/10003784973
Cover Image
A strongly polynomial simplex method for the linear fractional assignment problem
Kabadi, Santosh N.; Punnen, Abraham P. - In: Operations research letters 36 (2008) 4, pp. 402-407
Persistent link: https://www.econbiz.de/10003786684
Cover Image
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Brenner, Ulrich - In: Operations research letters 36 (2008) 4, pp. 408-413
Persistent link: https://www.econbiz.de/10003786685