Algorithms and Computation
From MaRDI portal
Publication:5897911
DOI10.1007/11602613zbMath1175.68192OpenAlexW2304246803MaRDI QIDQ5897911
Cristina Bazgan, Hassene Aissi, Daniel Vanderpooten
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (14)
On robust maximum flow with polyhedral uncertainty sets ⋮ Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty ⋮ Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) ⋮ Risk models for the prize collecting Steiner tree problems with interval data ⋮ The Complexity of Bottleneck Labeled Graph Problems ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Robust combinatorial optimization under budgeted-ellipsoidal uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ On the approximability of minmax (regret) network optimization problems ⋮ Unnamed Item ⋮ The complexity of bottleneck labeled graph problems ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
This page was built for publication: Algorithms and Computation
