In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well-known solvable instances. Tractable cases occur when the parameter is bounded by a constant.ou
Abstract Minmax regret optimization aims at finding robust solutions that perform best in the worst-...
While the complexity of min-max and min-max regret versions of most classical combinatorial optimiza...
International audienceThis paper addresses a class of problems under interval data uncertainty compo...
This paper focuses on tractable instances of interval data minmax regret graph problems. More precis...
We present in this paper general pseudo-polynomial time algorithms to solve min-maxand min-max regre...
We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regr...
AbstractWe consider the minimum spanning tree and the shortest path problems on a network with uncer...
AbstractWe consider combinatorial optimization problems with uncertain parameters of the objective f...
AbstractWe consider minmax regret bottleneck subset-type combinatorial optimization problems, where ...
This paper investigates the complexity of the min–max and min–max regret assignment problems both in...
[[abstract]]This paper studies the problem of finding the 1-median on a graph where vertex weights a...
International audienceIn this paper, we provide a generic anytime lower bounding procedure for minma...
In this paper, we propose a probabilistic model for minimizing the anticipated regret in com-binator...
Minmax regret optimization aims at finding robust solutions that perform best in the worst-case, com...
AbstractWhile the complexity of min–max and min–max regret versions of most classical combinatorial ...
Abstract Minmax regret optimization aims at finding robust solutions that perform best in the worst-...
While the complexity of min-max and min-max regret versions of most classical combinatorial optimiza...
International audienceThis paper addresses a class of problems under interval data uncertainty compo...
This paper focuses on tractable instances of interval data minmax regret graph problems. More precis...
We present in this paper general pseudo-polynomial time algorithms to solve min-maxand min-max regre...
We present in this paper general pseudo-polynomial time algorithms to solve min-max and min-max regr...
AbstractWe consider the minimum spanning tree and the shortest path problems on a network with uncer...
AbstractWe consider combinatorial optimization problems with uncertain parameters of the objective f...
AbstractWe consider minmax regret bottleneck subset-type combinatorial optimization problems, where ...
This paper investigates the complexity of the min–max and min–max regret assignment problems both in...
[[abstract]]This paper studies the problem of finding the 1-median on a graph where vertex weights a...
International audienceIn this paper, we provide a generic anytime lower bounding procedure for minma...
In this paper, we propose a probabilistic model for minimizing the anticipated regret in com-binator...
Minmax regret optimization aims at finding robust solutions that perform best in the worst-case, com...
AbstractWhile the complexity of min–max and min–max regret versions of most classical combinatorial ...
Abstract Minmax regret optimization aims at finding robust solutions that perform best in the worst-...
While the complexity of min-max and min-max regret versions of most classical combinatorial optimiza...
International audienceThis paper addresses a class of problems under interval data uncertainty compo...
DOI
Add to ORKG