Ribeiro, A branch-and-cut algorithm for partition coloring. In: Proc. of the Int. Network Optimization Conf., Spa, Belgium, Apr. 2007.Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C.: A branch-and-cut algorithm for partition coloring. Networks 55 , 194–204 (2010)...
Another related problem is the One-commodity Pickup-and-Delivery TSP (m- PDTSP when m commodities are considered) investigated by Hern´ andez-P´ erez and Salazar Gonz´ alez [21, 22]. In the 1-PDSTP, each vertex of a complete graph 1 A Branch-and-Cut Algorithm for the Preem...
Paula Carroll, Bernard Fortz, Martine Labbe, and Sean McGarraghy. A branch-and-cut algorithm for the ring spur assignment problem. Networks, 61(2) :89-103, 2013.Carroll P, Fortz B, Labbé M, McGarraghy S (2013) A branch-and-cut algorithm for the ring spur assignment problem. ...
A branch-and-cut algorithm for integer bilevel linear programs. Proc. of the INFORMS Computing Society Meeting, Charleston, USA, Jan. (2009)S. DeNegre and T. K. Ralphs, "A branch-and-cut algorithm for integer bilevel linear pro- grams," Oper. Res. and Cyber-Infrastructure, vol. 47,...
We give integer programming formulations and valid inequalities for the different versions of the problem, solve them using a branch-and-cut algorithm, and discuss computational results. Some of the new inequalities can be used also to solve other problems in the literature, like the plant cycle ...
The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem. The objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. We propose a new integer linear program for the problem and a branch-and-cut algorithm. We ...
We present a branch-and-cut algorithm for the identical customer Vehicle Routing Problem. Transforming the problem into an equivalent Path-Partitioning Problem allows us to exploit its polyhedral structure and to generate strong cuts corresponding to facet-inducing inequalities. By using cuts defined by...
general-purpose cutting planes; a cutting plane algorithm for CSP was tested in [28, 2]. A pure cutting plane approach appeared almost equally effective to branch-and-price for CSP with a single stock length [2]. In 2CP, the objective function has its values among integer combinations ...
Forum (2021) 2: 8 https://doi.org/10.1007/s43069-020-00052-x ORIGINAL RESEARCH A Branch‑and‑Cut‑and‑Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies Alberto Ceselli1 · Ángel Felipe2 · M. Teresa Ortuño2 · ...
Moreover, the branch-and-cut algorithm seems to perform consistently better on instances where the customers are located in clusters. The remainder of this paper is structured as follows: In Section 2, we present the new formulation for the SoftCluVRP. The components of the branch-and-cut ...