On exact solutions for the minmax regret spanning tree problem

by   Francisco Pérez-Galarce, et al.

The Minmax Regret Spanning Tree problem is studied in this paper. This is a generalization of the well-known Minimum Spanning Tree problem, which considers uncertainty in the cost function. Particularly,it is assumed that the cost parameter associated with each edge is an interval whose lower and upperlimits are known, and the Minmax Regret is the optimization criterion. The Minmax Regret SpanningTree problem is an NP-Hard optimization problem for which exact and heuristic approaches have beenproposed. Several exact algorithms are proposed and computationally compared with the most effectiveapproaches of the literature. It is shown that a proposed branch-and-cut approach outperforms theprevious approaches when considering several classes of instances from the literature.



There are no comments yet.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


Robust Algorithms for TSP and Steiner Tree

Robust optimization is a widely studied area in operations research, whe...

2D-Phase Unwrapping via Balanced Spanning Forests

Phase unwrapping is the process of recovering a continuous phase signal ...

Algorithms for the Minmax Regret Path Problem with Interval Data

The Shortest Path in networks is an important problem in Combinatorial O...

A constraint satisfaction approach to the robust spanning tree problem with interval data

Robust optimization is one of the fundamental approaches to deal with un...

The Minimum Cost Connected Subgraph Problem in Medical Image Analysis

Several important tasks in medical image analysis can be stated in the f...

Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects

We consider cost constrained versions of the minimum spanning tree probl...

A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem

Given an undirected graph with costs associated with each edge as well a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.