Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,360,697 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.
2014
2014
On the Multicast Lifetime of WANETs with Multibeam Antennas: Formulation, Algorithms, and Analysis
Song Guo
,
M. Guo
,
Victor C. M. Leung
,
Shui Yu
,
Yong Xiang
IEEE transactions on computers
2014
Corpus ID: 800943
We explore the multicast lifetime capacity of energy-limited wireless ad hoc networks using directional multibeam antennas by…
Expand
2013
2013
Approximating the Split Closure
M. Fischetti
,
Domenico Salvagnin
INFORMS journal on computing
2013
Corpus ID: 18709679
The split closure has been proved in practice to be a very tight approximation of the integer hull formulation of a generic mixed…
Expand
2009
2009
Tabu search-based metaheuristic algorithm for software system reliability problems
M. Caserta
,
A. M. Uribe
Computers & Operations Research
2009
Corpus ID: 10944260
2004
2004
Exact methods based on node routing formulations for arc routing problems
Roberto Baldacci
,
V. Maniezzo
2004
Corpus ID: 6125344
This paper proposes a new transformation of arc routing problems into equivalents node routing problems, with emphasis on the…
Expand
2002
2002
D.C. Programming for Solving a Class of Global Optimization Problems via Reformulation by Exact Penalty
Hoai An Le Thi
Global Constraint Optimization and Constraint…
2002
Corpus ID: 12072040
We consider a class of important problems in global optimization, namely concave minimization over a bounded polyhedral convex…
Expand
2001
2001
Strategies used by bonnet macaques (Macaca radiata) to reduce predation risk while sleeping
U. Ramakrishnan
,
R. Coss
Primates
2001
Corpus ID: 34596783
Sleep results in a decrease in alertness, which increases an animal’s vulnerability to predation. Therefore, choice of sleeping…
Expand
2001
2001
A family of inequalities for the generalized assignment polytope
Ismael R. de Farias
,
G. Nemhauser
Operations Research Letters
2001
Corpus ID: 28272933
1998
1998
A heuristic algorithm based on Monte Carlo methods for the rural postman problem
P. F. Córdoba
,
L. Garcia-Raffi
,
J. Sanchis
Computers & Operations Research
1998
Corpus ID: 32053372
Review
1996
Review
1996
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
S. Joy
,
J. Mitchell
,
B. Borchers
Satisfiability Problem: Theory and Applications
1996
Corpus ID: 7535998
DIMACS Series in Discrete Mathematicsand Theoretical Computer ScienceVolume00, 19xxA Branch and Cut Algorithm for MAX-SAT and…
Expand
1990
1990
Branch-and-cut solution of inference problems in propositional logic
J. Hooker
,
C. Fedjiki
Annals of Mathematics and Artificial Intelligence
1990
Corpus ID: 12457467
We describe and test computationally a branch-and-cut algorithm for solving inference problems in propositional logic. The…
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