IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v149y2007i1p185-19310.1007-s10479-006-0107-7.html
   My bibliography  Save this article

RLT: A unified approach for discrete and continuous nonconvex optimization

Author

Listed:
  • Hanif Sherali

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:149:y:2007:i:1:p:185-193:10.1007/s10479-006-0107-7
    DOI: 10.1007/s10479-006-0107-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0107-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0107-7?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. Warren P. Adams & Hanif D. Sherali, 1990. "Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems," Operations Research, INFORMS, vol. 38(2), pages 217-226, April.
    2. Mokhtar S. Bazaraa & Hanif D. Sherali, 1980. "Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(1), pages 29-41, March.
    3. Churlzu Lim & Hanif Sherali, 2006. "A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 33-53, August.
    4. 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.
    5. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    6. Hanif D. Sherali & Warren P. Adams, 1984. "A Decomposition Algorithm for a Discrete Location-Allocation Problem," Operations Research, INFORMS, vol. 32(4), pages 878-900, August.
    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. Hamidur Rahman & Ashutosh Mahajan, 2019. "Facets of a mixed-integer bilinear covering set with bounds on variables," Journal of Global Optimization, Springer, vol. 74(3), pages 417-442, July.
    2. Yu, Guodong & Haskell, William B. & Liu, Yang, 2017. "Resilient facility location against the risk of disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 82-105.
    3. Laureano F. Escudero & Celeste Pizarro Romero, 2017. "On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 601-622, October.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    9. 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.
    10. 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.
    11. 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.
    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. 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.
    14. 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.
    15. 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.
    16. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    17. 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.
    18. Hanif D. Sherali & J. Cole Smith & Antonio A. Trani, 2002. "An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations," Transportation Science, INFORMS, vol. 36(4), pages 378-397, November.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:annopr:v:149:y:2007:i:1:p:185-193:10.1007/s10479-006-0107-7. 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.