Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems-Reference-Cited by-同舟云学术

Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems

Published:2021-11 Issue: Volume: Page:
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yang Yu^ORCID,Boland Natashia^ORCID,Dilkina Bistra,Savelsbergh Martin^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference35 articles.

1. Constraint integer programming;Achterberg,2007

2. Branching rules revisited;Achterberg;Operations Research Letters,2005

3. Mixed integer programming: Analyzing 12 years of progress;Achterberg,2013

4. A supervised machine learning approach to variable branching in branch-and-bound;Àlvarez,2014

5. A machine learning-based approximation of strong branching;Àlvarez;INFORMS Journal on Computing,2017

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A machine learning approach to rank pricing problems in branch-and-price;European Journal of Operational Research;2025-01

2. Last‐mile delivery with drone and lockers;Networks;2023-10-04

3. Optimality Guaranteed UC Acceleration via Interactive Utilization of Adjoint Model;IEEE Transactions on Power Systems;2023

4. Two-Stage Learning to Branch in Branch-Price-And-Cut Algorithms for Solving Vehicle Routing Problems Exactly;SSRN Electronic Journal;2023

5. Ner4Opt: Named Entity Recognition for Optimization Modelling from Natural Language;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023