IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v121y2000i1p40-55.html
   My bibliography  Save this item

Conflict graphs in solving integer programming problems

Citations

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


Cited by:

  1. Nicolas Dupin, 2017. "Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 149-176, March.
  2. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Teresa Ortuno, M., 2003. "BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs," European Journal of Operational Research, Elsevier, vol. 151(3), pages 503-519, December.
  3. Tuomas Sandholm & Subhash Suri & Andrew Gilpin & David Levine, 2005. "CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions," Management Science, INFORMS, vol. 51(3), pages 374-390, March.
  4. Glaydston Mattos Ribeiro & Miguel Fragoso Constantino & Luiz Antonio Nogueira Lorena, 2010. "Strong formulation for the spot 5 daily photograph scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 385-398, November.
  5. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
  6. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
  7. Perraudat, Antoine & Dauzère-Pérès, Stéphane & Vialletelle, Philippe, 2022. "Robust tactical qualification decisions in flexible manufacturing systems," Omega, Elsevier, vol. 106(C).
  8. 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.
  9. Á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.
  10. Escudero, L. F. & Munoz, S., 2003. "On identifying dominant cliques," European Journal of Operational Research, Elsevier, vol. 149(1), pages 65-76, August.
  11. J. Paul Brooks & Eva K. Lee, 2014. "Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 567-585, August.
  12. Anantaram Balakrishnan & Gang Li & Prakash Mirchandani, 2017. "Optimal Network Design with End-to-End Service Requirements," Operations Research, INFORMS, vol. 65(3), pages 729-750, June.
  13. Robert Bixby & Edward Rothberg, 2007. "Progress in computational mixed integer programming—A look back from the other side of the tipping point," Annals of Operations Research, Springer, vol. 149(1), pages 37-41, February.
  14. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
  15. Avella, Pasquale & D'Auria, Bernardo & Salerno, Saverio, 2006. "A LP-based heuristic for a time-constrained routing problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 120-124, August.
  16. Alexandre Salles Cunha, 2022. "Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 379-413, August.
  17. Santanu S. Dey & Jean-Philippe Richard, 2009. "Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 137-150, February.
  18. Haroldo G. Santos & Túlio A. M. Toffolo & Rafael A. M. Gomes & Sabir Ribas, 2016. "Integer programming techniques for the nurse rostering problem," Annals of Operations Research, Springer, vol. 239(1), pages 225-251, April.
  19. Pedro A. Castillo Castillo & Pedro M. Castro & Vladimir Mahalec, 2018. "Global optimization of MIQCPs with dynamic piecewise relaxations," Journal of Global Optimization, Springer, vol. 71(4), pages 691-716, August.
  20. Patrick Bless & Diego Klabjan & Soo Chang, 2012. "Automated knowledge source selection and service composition," Computational Optimization and Applications, Springer, vol. 52(2), pages 507-535, June.
  21. Zwaneveld, P. & Verweij, G. & van Hoesel, S., 2018. "Safe dike heights at minimal costs: An integer programming approach," European Journal of Operational Research, Elsevier, vol. 270(1), pages 294-301.
  22. Dilson Lucas Pereira & Abilio Lucena & Alexandre Salles da Cunha & Luidi Simonetti, 2022. "Exact Solution Algorithms for the Chordless Cycle Problem," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1970-1986, July.
  23. J. Paul Brooks, 2012. "The Court of Appeals of Virginia Uses Integer Programming and Cloud Computing to Schedule Sessions," Interfaces, INFORMS, vol. 42(6), pages 544-553, December.
  24. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2019. "Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 38-63.
  25. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
  26. Jeff T. Linderoth & Eva K. Lee & Martin W. P. Savelsbergh, 2001. "A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 191-209, August.
  27. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2019. "Preprocessing and cut generation techniques for multi-objective binary programming," European Journal of Operational Research, Elsevier, vol. 274(3), pages 858-875.
  28. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.