Narrow search
Showing 1 - 6 of 6
Cover Image
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
Vielma, Juan Pablo; Ahmed, Shabbir; Nemhauser, George L. - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 438-450
Persistent link: https://www.econbiz.de/10003770186
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
On learning and branching : a survey
Lodi, Andrea; Zarpellon, Giulia - In: Top : transactions in operations research 25 (2017) 2, pp. 207-236
Persistent link: https://www.econbiz.de/10011725396
Cover Image
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua; Lodi, Andrea; Prouvost, Antoine - In: European journal of operational research : EJOR 290 (2021) 2, pp. 405-421
Persistent link: https://www.econbiz.de/10012495192
Cover Image
Cutting planes from the branch-and-bound tree : challenges and opportunities
Contardo, Claudio; Lodi, Andrea; Tramontani, Andrea - In: INFORMS journal on computing : JOC ; charting new … 35 (2023) 1, pp. 2-4
Persistent link: https://www.econbiz.de/10014327009
Cover Image
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu; Boland, Natashia; Dilkina, Bistra; … - In: European journal of operational research : EJOR 301 (2022) 3, pp. 828-840
Persistent link: https://www.econbiz.de/10013267791