# Branch and cut

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- Transportation Science
- 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)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Networks
- 2007

In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set ofâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Discrete Applied Mathematics
- 2006

In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extentâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Math. Program.
- 2005

A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex optimizationâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Math. Program.
- 2004

We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety ofâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IPCO
- 2004

Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cutâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Math. Program.
- 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

- INFORMS Journal on Computing
- 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)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- SIAM Review
- 1991

An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- 1988

Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they canâ€¦Â (More)

Is this relevant?