( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating Min-Max (Regret) Versions of Some Polynomial Problems.

, , и . COCOON, том 4112 из Lecture Notes in Computer Science, стр. 428-438. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Anass Aïssi

 

Другие публикации лиц с тем же именем

Robust capacity expansion of a network under demand uncertainty: A bi-objective approach., и . Networks, 68 (3): 185-199 (2016)Min-max and min-max regret versions of combinatorial optimization problems: A survey., , и . Eur. J. Oper. Res., 197 (2): 427-438 (2009)Faster Algorithms for Parametric Global Minimum Cut Problems., , и . CoRR, (2019)General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems., , и . Discret. Optim., 7 (3): 136-148 (2010)Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.. 4OR, 4 (4): 347-350 (2006)Complexity of the Min-Max (Regret) Versions of Cut Problems., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 789-798. Springer, (2005)Weighted sum model with partial preference information: Application to multi-objective optimization., , , и . Eur. J. Oper. Res., 260 (2): 665-679 (2017)On the minimum s-t cut problem with budget constraints., и . Math. Program., 203 (1): 421-442 (января 2024)Vertex downgrading to minimize connectivity., , и . Math. Program., 199 (1): 215-249 (мая 2023)Vertex Downgrading to Minimize Connectivity., , и . SWAT, том 162 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)