Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 223,681,475 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.
2017
2017
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
T. Queiroz
,
P. Hokama
,
R. Schouery
,
F. Miyazawa
Computers & industrial engineering
2017
Corpus ID: 20698219
2009
2009
Testing cut generators for mixed-integer linear programming
F. Margot
Mathematical Programming Computation
2009
Corpus ID: 7180497
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is…
Expand
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
2004
2004
Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line
D. Kodek
,
M. Krisper
2004
Corpus ID: 53993213
The problem of the optimal allocation of components to a printed circuit board assembly line will several non-identical placement…
Expand
Highly Cited
2003
Highly Cited
2003
BIBLIOGRAPHIC DATA AND CLASSIFICATIONS
2003
Corpus ID: 2821554
Highly Cited
2003
Highly Cited
2003
Tight formulations for some simple mixed integer programs and convex objective integer programs
Andrew J. Miller
,
L. Wolsey
Mathematical programming
2003
Corpus ID: 12177310
Abstract.We study the polyhedral structure of simple mixed integer sets that generalize the two variable set {(s,z)R1+×ℤ1:s≥z−b…
Expand
Highly Cited
2001
Highly Cited
2001
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints
M. Fischetti
,
Juan José SALAZAR-GONZÁLEZ
Management Sciences
2001
Corpus ID: 2375555
Cell suppression is a widely used technique for protecting sensitive information in statistical data presented in tabular form…
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
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
or Only Accept Required