Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,253,470 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.
2018
2018
Multi-Stage Algorithms for Solving a Generalized Capacitated P-median Location Problem
Mohammed El Amrani
,
Y. Benadada
2018
Corpus ID: 46991012
The capacitated p-median location problem is one of the famous problems widely discussed in the literature, but its…
Expand
2017
2017
LEOS-assisted Inter-GEOS Communication via Distributed-storage Coding
Haisheng Xu
,
Chen Gong
,
Haipeng Yao
,
Xiaodong Wang
arXiv.org
2017
Corpus ID: 4406976
We consider a space communication network consisting of Geosynchronous Earth Orbit satellites (GEOSs) and Low Earth Orbit…
Expand
2013
2013
Nurse Scheduling Based on Branch- and- Bound Algorithm
W. Daundasekera
,
S. Lanka.
2013
Corpus ID: 63899559
The main objective of this study is to search for a scientific method to prepare a weekly schedule for a group of nursing…
Expand
2012
2012
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
L. Gouveia
,
Jorge Riera-Ledesma
,
Juan José SALAZAR-GONZÁLEZ
Networks
2012
Corpus ID: 5470326
This article analyzes inequalities derived by projecting out the flow variables of a single‐commodity flow model for a vehicle…
Expand
2011
2011
Branch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicle Routing Problems
M. Jepsen
,
David Pisinger
2011
Corpus ID: 63133978
This paper presents a branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. The standard Dantzig…
Expand
2009
2009
Formulations for a Location-Routing Problem with Simultaneous Pickup and Delivery
Ismail Karaoglana
,
Fulya Altiparmakb
,
Imdat Karac
,
Berna Dengizc
2009
Corpus ID: 6714089
In this paper, we introduce a new variant of Location-Routing Problem (LRP), namely the LRP with simultaneous pickup and delivery…
Expand
2009
2009
The Benefit of Pooling Operating Rooms and Parallel Surgery Processing under Uncertainty
Sakine Batun
,
Brian T. Denton
,
T. Huschka
,
A. Schaefer
2009
Corpus ID: 17361989
Operating room (OR) scheduling is an important operational problem for most hospitals. In this study, we present a novel two…
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
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
1998
1998
Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC - PROD
Gaetan Belvaux
,
L. Wolsey
1998
Corpus ID: 7839811
BC-PROD is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot…
Expand