IDEAS home Printed from https://ideas.repec.org/r/cor/louvrp/1504.html
   My bibliography  Save this item

Mixing mixed-integer inequalities

Citations

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


Cited by:

  1. WOLSEY, Laurence A., 2005. "Lot-sizing with production and delivery time windows," LIDAM Discussion Papers CORE 2005043, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  2. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
  3. Yan Deng & Siqian Shen & Brian Denton, 2019. "Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 559-575, July.
  4. Akbalik, A. & Pochet, Y., 2009. "Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs," European Journal of Operational Research, Elsevier, vol. 198(2), pages 412-434, October.
  5. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
  6. Soumya Ranjan Pathy & Hamed Rahimian, 2024. "Value of risk aversion in perishable products supply chain management," Computational Optimization and Applications, Springer, vol. 89(2), pages 517-552, November.
  7. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
  8. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
  9. Reich, Daniel, 2013. "A linear programming approach for linear programs with probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 230(3), pages 487-494.
  10. Gérard Cornuéjols & Yanjun Li & Dieter Vandenbussche, 2003. "K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 385-396, November.
  11. CONFORTI, Michele & DI SUMMA, Marco & WOLSEY, Laurence, 2005. "The mixing set with flows," LIDAM Discussion Papers CORE 2005092, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  12. CONFORTI, Michele & DI SUMMA, Marco & EISENBRAND, Fritz & WOLSEY, Laurence A., 2006. "Network formulations of mixed-integer programs," LIDAM Discussion Papers CORE 2006117, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  13. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
  14. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
  15. Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
  16. Michele Conforti & Laurence A. Wolsey & Giacomo Zambelli, 2010. "Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 603-623, August.
  17. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
  18. Bansal, Manish & Mehrotra, Sanjay, 2019. "On solving two-stage distributionally robust disjunctive programs with a general ambiguity set," European Journal of Operational Research, Elsevier, vol. 279(2), pages 296-307.
  19. DI SUMMA, Marco & WOLSEY, Laurence, 2010. "Mixing sets linked by bidirected paths," LIDAM Discussion Papers CORE 2010063, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  20. Mathieu Van Vyve, 2005. "The Continuous Mixing Polyhedron," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 441-452, May.
  21. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.
  22. Elçi, Özgün & Noyan, Nilay, 2018. "A chance-constrained two-stage stochastic programming model for humanitarian relief network design," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 55-83.
  23. Kai Pan & Yongpei Guan, 2016. "Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment," Operations Research, INFORMS, vol. 64(6), pages 1482-1498, December.
  24. Santanu S. Dey & Quentin Louveaux, 2011. "Split Rank of Triangle and Quadrilateral Inequalities," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 432-461, August.
  25. Michele Conforti & Marco Di Summa & Friedrich Eisenbrand & Laurence A. Wolsey, 2009. "Network Formulations of Mixed-Integer Programs," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 194-209, February.
  26. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2013. "Extended formulations in combinatorial optimization," Annals of Operations Research, Springer, vol. 204(1), pages 97-143, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.