IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v32y1986i10p1274-1290.html
   My bibliography  Save this item

A Tight Linearization and an Algorithm for Zero-One Quadratic 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. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.
  3. Sherali, Hanif D. & Desai, Jitamitra & Rakha, Hesham, 2006. "A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 857-871, December.
  4. Peter Hahn & Thomas Grant, 1998. "Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation," Operations Research, INFORMS, vol. 46(6), pages 912-922, December.
  5. 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.
  6. 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.
  7. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
  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. Nihal Berktaş & Hande Yaman, 2021. "A Branch-and-Bound Algorithm for Team Formation on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1162-1176, July.
  10. Billionnet, Alain & Calmels, Frederic, 1996. "Linear programming for the 0-1 quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 310-325, July.
  11. Caprara, Alberto, 2008. "Constrained 0-1 quadratic programming: Basic approaches and extensions," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1494-1503, June.
  12. Adams, Warren P. & Guignard, Monique & Hahn, Peter M. & Hightower, William L., 2007. "A level-2 reformulation-linearization technique bound for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 983-996, August.
  13. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
  14. 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.
  15. 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.
  16. Sven Mallach, 2018. "Compact linearization for binary quadratic problems subject to assignment constraints," 4OR, Springer, vol. 16(3), pages 295-309, September.
  17. Stefan Helber & Daniel Böhme & Farid Oucherif & Svenja Lagershausen & Steffen Kasper, 2016. "A hierarchical facility layout planning approach for large and complex hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 5-29, June.
  18. Sven Mallach, 2021. "Inductive linearization for binary quadratic programs with linear constraints," 4OR, Springer, vol. 19(4), pages 549-570, December.
  19. Erdemir, Elif Tokar & Batta, Rajan & Spielman, Seth & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2008. "Location coverage models with demand originating from nodes and paths: Application to cellular network design," European Journal of Operational Research, Elsevier, vol. 190(3), pages 610-632, November.
  20. 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.
  21. Danczyk, Adam & Liu, Henry X., 2011. "A mixed-integer linear program for optimizing sensor locations along freeway corridors," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 208-217, January.
  22. Hanif D. Sherali & Warren P. Adams & Patrick J. Driscoll, 1998. "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems," Operations Research, INFORMS, vol. 46(3), pages 396-405, June.
  23. 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.
  24. Jean B. Lasserre, 2002. "Semidefinite Programming vs. LP Relaxations for Polynomial Programming," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 347-360, May.
  25. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
  26. 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.
  27. 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.
  28. Hahn, Peter M. & Kim, Bum-Jin & Stutzle, Thomas & Kanthak, Sebastian & Hightower, William L. & Samra, Harvind & Ding, Zhi & Guignard, Monique, 2008. "The quadratic three-dimensional assignment problem: Exact and approximate solution methods," European Journal of Operational Research, Elsevier, vol. 184(2), pages 416-428, January.
  29. 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.
  30. Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
  31. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.
  32. Letchford, Adam N. & Nasiri, Saeideh D., 2015. "The Steiner travelling salesman problem with correlated costs," European Journal of Operational Research, Elsevier, vol. 245(1), pages 62-69.
  33. Turner, S.D.O. & Romero, D.A. & Zhang, P.Y. & Amon, C.H. & Chan, T.C.Y., 2014. "A new mathematical programming approach to optimize wind farm layouts," Renewable Energy, Elsevier, vol. 63(C), pages 674-680.
  34. 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.
  35. Lagos, Guido & Espinoza, Daniel & Moreno, Eduardo & Vielma, Juan Pablo, 2015. "Restricted risk measures and robust optimization," European Journal of Operational Research, Elsevier, vol. 241(3), pages 771-782.
  36. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
  37. 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.
  38. 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.
  39. 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.
  40. Timothy C. Y. Chan & Derya Demirtas & Roy H. Kwon, 2016. "Optimizing the Deployment of Public Access Defibrillators," Management Science, INFORMS, vol. 62(12), pages 3617-3635, December.
  41. Fabio Furini & Emiliano Traversi, 2019. "Theoretical and computational study of several linearisation techniques for binary quadratic problems," Annals of Operations Research, Springer, vol. 279(1), pages 387-411, August.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.