Beyond Canonical DC-Optimization: The Single Reverse Polar Problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-012-0069-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Fulop, Janos, 1990. "A finite cutting plane method for solving linear programs with an additional reverse convex constraint," European Journal of Operational Research, Elsevier, vol. 44(3), pages 395-409, February.
- Rafael Blanquero & Emilio Carrizosa & Pierre Hansen, 2009. "Locating Objects in the Plane Using Global Optimization Techniques," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 837-858, November.
- Giancarlo Bigi & Antonio Frangioni & Qinghua Zhang, 2010. "Outer approximation algorithms for canonical DC problems," Journal of Global Optimization, Springer, vol. 46(2), pages 163-189, February.
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.- Qinghua Zhang, 2013. "A new necessary and sufficient global optimality condition for canonical DC problems," Journal of Global Optimization, Springer, vol. 55(3), pages 559-577, March.
- M. V. Dolgopolik, 2020. "New global optimality conditions for nonsmooth DC optimization problems," Journal of Global Optimization, Springer, vol. 76(1), pages 25-55, January.
- Schöbel, Anita & Scholz, Daniel, 2014. "A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables," European Journal of Operational Research, Elsevier, vol. 232(2), pages 266-275.
- Giancarlo Bigi & Antonio Frangioni & Qinghua Zhang, 2010. "Outer approximation algorithms for canonical DC problems," Journal of Global Optimization, Springer, vol. 46(2), pages 163-189, February.
- Blanquero, Rafael & Carrizosa, Emilio & Schöbel, Anita & Scholz, Daniel, 2011. "A global optimization procedure for the location of a median line in the three-dimensional space," European Journal of Operational Research, Elsevier, vol. 215(1), pages 14-20, November.
- Carrizosa, Emilio & Goerigk, Marc & Schöbel, Anita, 2017. "A biobjective approach to recoverable robustness based on location planning," European Journal of Operational Research, Elsevier, vol. 261(2), pages 421-435.
- Rafael Blanquero & Emilio Carrizosa, 2013. "Solving the median problem with continuous demand on a network," Computational Optimization and Applications, Springer, vol. 56(3), pages 723-734, December.
More about this item
Keywords
Single reverse polar problems; Approximate optimality conditions; Cutting plane algorithms;All these keywords.
Statistics
Access and download statisticsCorrections
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:joptap:v:155:y:2012:i:2:d:10.1007_s10957-012-0069-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.