DeepAI AI Chat
Log In Sign Up

On Solving Cycle Problems with Branch-and-Cut: Extending Shrinking and Exact Subcycle Elimination Separation Algorithms

by   Gorka Kobeaga, et al.

In this paper, we extend techniques developed in the context of the Travelling Salesperson Problem for cycle problems. Particularly, we study the shrinking of support graphs and the exact algorithms from subcycle elimination separation problems. The efficient application of the considered techniques has proved to be essential in the Travelling Salesperson Problem when solving large size problems by Branch-and-Cut, and this has been the motivation behind this work. Regarding the shrinking of support graphs, we prove the validity of the Padberg-Rinaldi general shrinking rules and the Crowder-Padberg subcycle-safe shrinking rules. Concerning the subcycle separation problems, we extend two exact separation algorithms, the Dynamic Hong and the Extended Padberg-Grötschel algorithms, which are shown to be superior to the ones used so far in the literature of cycle problems. The proposed techniques are empirically tested in 24 subcycle elimination problem instances generated by solving the Orienteering Problem (involving up to 15112 vertices) with Branch-and-Cut. The experiments suggest the relevance of the proposed techniques for cycle problems. The obtained average speedup for the subcycle separation problems in the Orienteering Problem when the proposed techniques are used together is around 50 times in medium-sized instances and around 250 times in large-sized instances.


page 1

page 2

page 3

page 4


A revisited branch-and-cut algorithm for large-scale orienteering problems

The orienteering problem is a route optimization problem which consists ...

Branch-and-cut algorithms for the covering salesman problem

The Covering Salesman Problem (CSP) is a generalization of the Traveling...

Faster exact solution of sparse MaxCut and QUBO problems

The maximum-cut problem is one of the fundamental problems in combinator...

Solving the minimum labeling global cut problem by mathematical programming

Let G = (V, E, L) be an edge-labeled graph such that V is the set of ver...

RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences

MB-DPOP is an important complete algorithm for solving Distributed Const...

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

A weighted constraint satisfaction problem (WCSP) is a constraint satisf...

BEEM : Bucket Elimination with External Memory

A major limitation of exact inference algorithms for probabilistic graph...