Information-based branching schemes for binary linear mixed integer problems-Reference-Cited by-同舟云学术

Information-based branching schemes for binary linear mixed integer problems

Published:2009-12 Issue:4 Volume:1 Page:249-293
ISSN:1867-2949
Container-title:Mathematical Programming Computation
language:en
Short-container-title:Math. Prog. Comp.

Author:

Kılınç Karzan Fatma,Nemhauser George L.,Savelsbergh Martin W. P.

Publisher

Springer Science and Business Media LLC

Subject

Software,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s12532-009-0009-1.pdf

Reference40 articles.

1. Achterberg T.: Conflict analysis in mixed integer programming. Discrete. Optim. 4, 4–20 (2007a)

2. Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin. http://opus.kobv.de/tuberlin/volltexte/2007/1611/ (2007b)

3. Achterberg T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1–32 (2009)

4. Achterberg T., Berthold T.: Hybrid branching. In: van Hoeve, W.J., Hooker, J.N. (eds) CPAIOR, Lecture Notes in Computer Science, vol. 5547, pp. 309–311. Springer, Berlin (2009)

5. Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33, 42–54 (2005)

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

1. One-Shot Learning for MIPs with SOS1 Constraints;Operations Research Forum;2024-07-01

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

3. Learn, Compare, Search: One Sawmill’s Search for the Best Cutting Patterns Across and/or Trees;Lecture Notes in Computer Science;2023

4. Conflict Analysis for MINLP;INFORMS Journal on Computing;2021-03-30

5. Computational aspects of infeasibility analysis in mixed integer programming;Mathematical Programming Computation;2021-03-06