Tractable algorithms for chance-constrained combinatorial problems
RAIRO-Oper. Res., 43 2 (2009) 157-187
Published online: 2009-04-28
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
1 (2025)
https://doi.org/10.1007/978-1-4614-6624-6_85-1
450 (2024)
https://doi.org/10.1109/ISML60050.2024.11007447
Chance-Constrained Flight Level Assignment Problem
Chenghao Wang, Akli Fundo, Jean-Benoist Leger and Dritan NaceIEEE Transactions on Intelligent Transportation Systems 24 (6) 6065 (2023)
https://doi.org/10.1109/TITS.2023.3253303
Belief Functions: Theory and Applications
Akli Fundo, Dritan Nace and Chenghao WangLecture Notes in Computer Science, Belief Functions: Theory and Applications 11069 86 (2018)
https://doi.org/10.1007/978-3-319-99383-6_12
Delay-Constrained Caching in Cognitive Radio Networks
Jing Zhao, Wei Gao, Yi Wang and Guohong CaoIEEE Transactions on Mobile Computing 15 (3) 627 (2016)
https://doi.org/10.1109/TMC.2015.2426715
2094 (2014)
https://doi.org/10.1109/INFOCOM.2014.6848151
The Express heuristic for probabilistically constrained integer problems
Maria Elena Bruni, Patrizia Beraldi and Demetrio LaganàJournal of Heuristics 19 (3) 423 (2013)
https://doi.org/10.1007/s10732-013-9218-x
Cover inequalities for robust knapsack sets—Application to the robust bandwidth packing problem
Olivier Klopfenstein and Dritan NaceNetworks 59 (1) 59 (2012)
https://doi.org/10.1002/net.20488
2581 (2007)
https://doi.org/10.1109/GLOCOM.2007.490