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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
05019762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex optimization… (More)
  • figure 2
  • figure 3
  • table 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols [2] and devevlop a branchand-cut method for solving 0-1… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Bran h-and-Cut Matteo Fis hetti DEI, University of Padova, 35131 Padova, Italy; Email: s h dei.unipd.it Juan Jos e Salazar Gonz… (More)
  • figure 2.1
  • figure 2.2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The… (More)
  • figure 3
  • figure 4
  • figure 6
  • table 2
  • figure 7
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?