New formulations and branch-and-cut procedures for the longest induced path problem

04/19/2021
by   Ruslán G. Marzo, et al.
0

Given an undirected graph G=(V,E), the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset W⊆ V such that W induces a simple path in G. In this paper, we propose two new formulations with an exponential number of constraints for the problem, together with effective branch-and-cut procedures for its solution. While the first formulation (cec) is based on constraints that explicitly eliminate cycles, the second one (cut) ensures connectivity via cutset constraints. We compare, both theoretically and experimentally, the newly proposed approaches with a state-of-the-art formulation recently proposed in the literature. More specifically, we show that the polyhedra defined by formulation cut and that of the formulation available in the literature are the same. Besides, we show that these two formulations are stronger in theory than cec. We also propose a new branch-and-cut procedure using the new formulations. Computational experiments show that the newly proposed formulation cec, although less strong from a theoretical point of view, is the best performing approach as it can solve all but one of the 1065 benchmark instances used in the literature within the given time limit. In addition, our newly proposed approaches outperform the state-of-the-art formulation when it comes to the median times to solve the instances to optimality. Furthermore, we perform extended computational experiments considering more challenging and hard-to-solve larger instances and evaluate the impacts on the results when offering initial feasible solutions (warm starts) to the formulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2021

Maximum weighted induced forests and trees: New formulations and a computational comparative review

Given a graph G=(V,E) with a weight w_v associated with each vertex v∈ V...
research
02/17/2020

An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Given a graph G=(V,E), the longest induced path problem asks for a maxim...
research
05/02/2019

Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle

Hashiwokakero, or simply Hashi, is a Japanese single-player puzzle playe...
research
03/22/2023

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks

The COVID-19 pandemic has been a recent example for the spread of a harm...
research
11/23/2022

Exact solution approaches for the discrete α-neighbor p-center problem

The discrete α-neighbor p-center problem (d-α-pCP) is an emerging varian...
research
06/15/2018

Formulations for designing robust networks. An application to wind power collection

We are interested in the design of survivable capacitated rooted Steiner...
research
05/25/2018

Extended Formulations for Radial Cones

This paper studies extended formulations for radial cones at vertices of...

Please sign up or login with your details

Forgot password? Click here to reset