IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v45y2010i3p607-638.html
   My bibliography  Save this article

Solving chance-constrained combinatorial problems to optimality

Author

Listed:
  • Olivier Klopfenstein

Abstract

No abstract is available for this item.

Suggested Citation

  • Olivier Klopfenstein, 2010. "Solving chance-constrained combinatorial problems to optimality," Computational Optimization and Applications, Springer, vol. 45(3), pages 607-638, April.
    • Handle: RePEc:spr:coopap:v:45:y:2010:i:3:p:607-638
    DOI: 10.1007/s10589-008-9177-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-008-9177-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-008-9177-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter Kall & János Mayer, 2005. "Stochastic Linear Programming," International Series in Operations Research and Management Science, Springer, number 978-0-387-24440-2, December.
    2. G. C. Calafiore & L. El Ghaoui, 2006. "On Distributionally Robust Chance-Constrained Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 1-22, July.
    3. David Bradley & Ramesh Gupta, 2002. "On the Distribution of the Sum of n Non-Identically Distributed Uniform Random Variables," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 54(3), pages 689-700, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.
    2. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    3. Beraldi, Patrizia & Bruni, Maria Elena & Laganà, Demetrio & Musmanno, Roberto, 2015. "The mixed capacitated general routing problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 240(2), pages 382-392.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    2. Calafiore, Giuseppe Carlo & Parino, Francesco & Zino, Lorenzo & Rizzo, Alessandro, 2023. "Dynamic planning of a two-dose vaccination campaign with uncertain supplies," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1269-1278.
    3. Bilsel, R. Ufuk & Ravindran, A., 2011. "A multiobjective chance constrained programming model for supplier selection under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1284-1300, September.
    4. Rashed Khanjani-Shiraz & Ali Babapour-Azar & Zohreh Hosseini-Noudeh & Panos M. Pardalos, 2022. "Distributionally robust maximum probability shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 140-167, January.
    5. Ekin, Tahir, 2018. "Integrated maintenance and production planning with endogenous uncertain yield," Reliability Engineering and System Safety, Elsevier, vol. 179(C), pages 52-61.
    6. Dirk Lorenz & Marc Pfetsch & Andreas Tillmann, 2014. "An infeasible-point subgradient method using adaptive approximate projections," Computational Optimization and Applications, Springer, vol. 57(2), pages 271-306, March.
    7. Hidetoshi Murakami, 2014. "A saddlepoint approximation to the distribution of the sum of independent non-identically uniform random variables," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 68(4), pages 267-275, November.
    8. Buonocore, Aniello & Pirozzi, Enrica & Caputo, Luigia, 2009. "A note on the sum of uniform random variables," Statistics & Probability Letters, Elsevier, vol. 79(19), pages 2092-2097, October.
    9. Mr. Udaibir S Das & Miss Yinqiu Lu & Mr. Michael G. Papaioannou & Iva Petrova, 2012. "Sovereign Risk and Asset and Liability Management: Conceptual Issues," IMF Working Papers 2012/241, International Monetary Fund.
    10. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    11. Xufeng Tang & Chang Liu & Xinqi Li & Ying Ji, 2023. "Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency," Sustainability, MDPI, vol. 15(18), pages 1-27, September.
    12. Corina Birghila & Tim J. Boonen & Mario Ghossoub, 2023. "Optimal insurance under maxmin expected utility," Finance and Stochastics, Springer, vol. 27(2), pages 467-501, April.
    13. Aharon Ben-Tal & Dimitris Bertsimas & David B. Brown, 2010. "A Soft Robust Model for Optimization Under Ambiguity," Operations Research, INFORMS, vol. 58(4-part-2), pages 1220-1234, August.
    14. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    15. Mohsen Zamani & Mahdi Abolghasemi & Seyed Mohammad Seyed Hosseini & Mir Saman Pishvaee, 2019. "Considering pricing and uncertainty in designing a reverse logistics network," Papers 1909.11633, arXiv.org.
    16. Zhou, Feng & Huang, Gordon H. & Chen, Guo-Xian & Guo, Huai-Cheng, 2009. "Enhanced-interval linear programming," European Journal of Operational Research, Elsevier, vol. 199(2), pages 323-333, December.
    17. Peter Kall & János Mayer, 2006. "Some insights into the solution algorithms for SLP problems," Annals of Operations Research, Springer, vol. 142(1), pages 147-164, February.
    18. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    19. Fang, Xin & Cui, Hantao & Du, Ershun & Li, Fangxing & Kang, Chongqing, 2021. "Characteristics of locational uncertainty marginal price for correlated uncertainties of variable renewable generation and demands," Applied Energy, Elsevier, vol. 282(PA).
    20. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:45:y:2010:i:3:p:607-638. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.