Narrow search
Showing 1 - 7 of 7
Cover Image
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre; Nemhauser, George L. - In: Operations research letters 43 (2015) 3, pp. 273-278
Persistent link: https://www.econbiz.de/10011309550
Cover Image
Bounds on the size of branch-and-bound proofs for integer knapsacks
Krishnamoorthy, Bala - In: Operations research letters 36 (2008) 1, pp. 19-25
Persistent link: https://www.econbiz.de/10003768458
Cover Image
An improved Benders decomposition applied to a multi-layer network design problem
Fortz, B.; Poss, M. - In: Operations research letters 37 (2009) 5, pp. 359-364
Persistent link: https://www.econbiz.de/10003932251
Cover Image
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long; Yuan, Jinjiang - In: Operations research letters 41 (2013) 4, pp. 363-365
Persistent link: https://www.econbiz.de/10009772782
Cover Image
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
Davis, James M.; Gandhi, Rajiv; Kothari, Vijay H. - In: Operations research letters 41 (2013) 2, pp. 121-125
Persistent link: https://www.econbiz.de/10009727797
Cover Image
On globally solving the extended trust-region subproblems
Dai, Jinyu - In: Operations research letters 48 (2020) 4, pp. 441-445
Persistent link: https://www.econbiz.de/10012294765
Cover Image
BBPH : using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
Barnett, Jason; Watson, Jean-Paul; Woodruff, David L. - In: Operations research letters 45 (2017) 1, pp. 34-39
Persistent link: https://www.econbiz.de/10011687115