Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,378,472 papers from all fields of science
Search
Sign In
Create Free Account
Branch and cut
Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Arc routing
Branch and bound
Branch and price
Computational science
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Optimal joint replenishment, delivery and inventory management policies for perishable products
Leandro C. Coelho
,
G. Laporte
Computers & Operations Research
2014
Corpus ID: 101606
Highly Cited
2011
Highly Cited
2011
Integrated topology control and routing in wireless sensor networks for prolonged network lifetime
H. Üster
,
Hui-I Lin
Ad hoc networks
2011
Corpus ID: 20907143
Highly Cited
2008
Highly Cited
2008
Profit-oriented disassembly-line balancing
F. T. Altekin
,
Levent Kandiller
,
N. E. Ozdemirel
2008
Corpus ID: 16769337
As product and material recovery has gained importance, disassembly volumes have increased, justifying construction of…
Expand
Highly Cited
2005
Highly Cited
2005
A branch and cut algorithm for hub location problems with single assignment
M. Labbé
,
H. Yaman
,
É. Gourdin
Mathematical programming
2005
Corpus ID: 6711511
Abstract.The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs…
Expand
Highly Cited
2003
Highly Cited
2003
An Application of Branch and Cut to Open Pit Mine Scheduling
L. Caccetta
,
S. Hill
Journal of Global Optimization
2003
Corpus ID: 32266074
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in…
Expand
Highly Cited
2003
Highly Cited
2003
Enhanced Model Formulations for Optimal Facility Layout
H. Sherali
,
B. Fraticelli
,
R. Meller
Operational Research
2003
Corpus ID: 7037282
This paper presents an improved mixed-integer programming (MIP) model and effective solution strategies for the facility layout…
Expand
Highly Cited
2001
Highly Cited
2001
Pruning by isomorphism in branch-and-cut
F. Margot
Mathematical programming
2001
Corpus ID: 17741715
Abstract. The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group…
Expand
Highly Cited
2000
Highly Cited
2000
The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization
M. Jünger
,
Stefan Thienel
Software, Practice & Experience
2000
Corpus ID: 14372340
The development of new mathematical theory and its application in software systems for the solution of hard optimization problems…
Expand
Highly Cited
1997
Highly Cited
1997
A branch-and-cut algorithm for the equicut problem
Lorenzo Brunetta
,
M. Conforti
,
Giovanni Rinaldi
Mathematical programming
1997
Corpus ID: 264241195
We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane…
Expand
Highly Cited
1988
Highly Cited
1988
Branch-and-Cut Algorithms for Combinatorial Optimization Problems
J. Mitchell
1988
Corpus ID: 14530622
Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required