DeepAI AI Chat
Log In Sign Up

Solving the minimum labeling global cut problem by mathematical programming

by   Thiago Gouveia da Silva, et al.

Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e ∈ E has a label l(e) associated; The goal of the minimum labeling global cut problem (MLGCP) is to find a subset L ⊆ L of labels such that G = (V, E , LŁ ) is not connected and |L| is minimized. This work proposes three new mathematical formulations for the MLGCP as well as branch-and-cut algorithms to solve them. The computational experiments showed that the proposed methods are able to solve small to average sized instances in a reasonable amount of time.


page 1

page 2

page 3

page 4


Approximating the Weighted Minimum Label s-t Cut Problem

In the weighted (minimum) Label s-t Cut problem, we are given a (directe...

Strong rainbow disconnection in graphs

Let G be a nontrivial edge-colored connected graph. An edge-cut R of G i...

Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson

Let G be a directed graph associated with a weight w: E(G) → R^+. For an...

The Landscape of Minimum Label Cut (Hedge Connectivity) Problem

Minimum Label Cut (or Hedge Connectivity) problem is defined as follows:...

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

Hashiwokakero, or simply Hashi, is a Japanese single-player puzzle playe...

An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem

We propose an efficient branch-and-cut algorithm to exactly solve the pa...