IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v38y1990i2p217-226.html
   My bibliography  Save this item

Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems

Citations

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


Cited by:

  1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
  2. Flores, Salvador, 2015. "SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression," European Journal of Operational Research, Elsevier, vol. 246(1), pages 44-50.
  3. Azizi, Nader & Salhi, Said, 2022. "Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor," European Journal of Operational Research, Elsevier, vol. 298(3), pages 834-854.
  4. Bjørndal, Endre & Jörnsten, Kurt, 2009. "Lower and upper bounds for linear production games," European Journal of Operational Research, Elsevier, vol. 196(2), pages 476-486, July.
  5. Jeong, Jaehee & Premsankar, Gopika & Ghaddar, Bissan & Tarkoma, Sasu, 2024. "A robust optimization approach for placement of applications in edge computing considering latency uncertainty," Omega, Elsevier, vol. 126(C).
  6. Lucas A. Waddell & Jerry L. Phillips & Tianzhu Liu & Swarup Dhar, 2023. "An LP-based characterization of solvable QAP instances with chess-board and graded structures," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-23, July.
  7. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
  8. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
  9. Hesham Rakha & Mazen Arafeh, 2010. "Calibrating Steady-State Traffic Stream and Car-Following Models Using Loop Detector Data," Transportation Science, INFORMS, vol. 44(2), pages 151-168, May.
  10. Maximilian Roth & Georg Franke & Stephan Rinderknecht, 2022. "A Comprehensive Approach for an Approximative Integration of Nonlinear-Bivariate Functions in Mixed-Integer Linear Programming Models," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
  11. Sándor F. Tóth & Robert G. Haight & Luke W. Rogers, 2011. "Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks," Operations Research, INFORMS, vol. 59(5), pages 1059-1078, October.
  12. Teles, João P. & Castro, Pedro M. & Matos, Henrique A., 2013. "Univariate parameterization for global optimization of mixed-integer polynomial problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 613-625.
  13. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
  14. Ghaffarpour, Reza & Mozafari, Babak & Ranjbar, Ali Mohammad & Torabi, Taghi, 2018. "Resilience oriented water and energy hub scheduling considering maintenance constraint," Energy, Elsevier, vol. 158(C), pages 1092-1104.
  15. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
  16. Peter M. Hahn & Yi-Rong Zhu & Monique Guignard & William L. Hightower & Matthew J. Saltzman, 2012. "A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 202-209, May.
  17. Keith Zorn & Nikolaos Sahinidis, 2014. "Global optimization of general nonconvex problems with intermediate polynomial substructures," Journal of Global Optimization, Springer, vol. 59(2), pages 673-693, July.
  18. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
  19. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
  20. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
  21. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
  22. Jung, Jihye & Choi, In-Chan, 2022. "A multi-objective optimization model for dissolving circular shareholdings in Korean conglomerates," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
  23. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
  24. As'ad, Rami & Demirli, Kudret, 2010. "Production scheduling in steel rolling mills with demand substitution: Rolling horizon implementation and approximations," International Journal of Production Economics, Elsevier, vol. 126(2), pages 361-369, August.
  25. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
  26. Luca Chiaraviglio & Lavinia Amorosi & Nicola Blefari‐Melazzi & Paolo Dell'Olmo & Mohammad Shojafar & Stefano Salsano, 2019. "Optimal management of reusable functional blocks in 5G superfluid networks," International Journal of Network Management, John Wiley & Sons, vol. 29(1), January.
  27. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
  28. Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, April.
  29. Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.