Some tractable instances of interval data minmax regret problems: bounded distance from triviality

In this paper two versions of a novel exact algorithm for the robust shortest path problem with interval data, based on Benders decomposition, are presented..

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

Given an undirected labeled connected graph (i.e., with a label or color for each edge), the minimum labeling spanning tree problem seeks a spanning tree whose edges have the smallest

From this point of view, the solutions in the critical mass case with finite initial second moment are choosing in their large time asymptotics the only possible stationary state with

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear

• If there is no outgoing edge, that means that the maximum degree of this spanning tree cannot be improved, this node send a message ”stop” to its parents.. The ”stop” message

Before concluding the paper let us note that another way for estimating the approxi- mation quality of an anticipatory solution S for PROBABILISTIC STEINER TREE (M), for

For most of the considered models, robust version of the shortest path problem becomes NP-difficult, excepted for the worst case analysis with the interval model which is tractable