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

An Algorithm for Separable Nonconvex Programming Problems

Citations

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


Cited by:

  1. Pete Janes & Alistair Rendell, 2013. "Deterministic global optimization in ab-initio quantum chemistry," Journal of Global Optimization, Springer, vol. 56(2), pages 537-558, June.
  2. Gjerdrum, Jonatan & Shah, Nilay & Papageorgiou, Lazaros G., 2002. "Fair transfer price and inventory holding policies in two-enterprise supply chains," European Journal of Operational Research, Elsevier, vol. 143(3), pages 582-599, December.
  3. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  4. April K. Andreas & J. Cole Smith, 2008. "Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 553-564, November.
  5. Mario Vanhoucke, 2002. "Optimal due date assignment in project scheduling," Vlerick Leuven Gent Management School Working Paper Series 2002-19, Vlerick Leuven Gent Management School.
  6. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
  7. Wooseung Jang & J. George Shanthikumar, 2002. "Stochastic allocation of inspection capacity to competitive processes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 78-94, February.
  8. Yong Xia & Longfei Wang & Meijia Yang, 2019. "A fast algorithm for globally solving Tikhonov regularized total least squares problem," Journal of Global Optimization, Springer, vol. 73(2), pages 311-330, February.
  9. Jens Deussen & Uwe Naumann, 2023. "Subdomain separability in global optimization," Journal of Global Optimization, Springer, vol. 86(3), pages 573-588, July.
  10. Achim Wechsung & Paul Barton, 2014. "Global optimization of bounded factorable functions with discontinuities," Journal of Global Optimization, Springer, vol. 58(1), pages 1-30, January.
  11. T. Kuno, 1999. "Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 121-135, October.
  12. Frank Karsten & Marco Slikker & Peter Borm, 2017. "Cost allocation rules for elastic single‐attribute situations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 271-286, June.
  13. Jungho Park & Hadi El-Amine & Nevin Mutlu, 2021. "An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1213-1228, July.
  14. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  15. Takahito Kuno, 2018. "A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ ω -subdivision," Journal of Global Optimization, Springer, vol. 71(2), pages 297-311, June.
  16. Benson, Harold P., 2006. "Fractional programming with convex quadratic forms and functions," European Journal of Operational Research, Elsevier, vol. 173(2), pages 351-369, September.
  17. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.
  18. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.
  19. Harold P. Benson & S. Selcuk Erenguc, 1990. "An algorithm for concave integer minimization over a polyhedron," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 515-525, August.
  20. Harold P. Benson, 2004. "Concave envelopes of monomial functions over rectangles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 467-476, June.
  21. Paula Amaral & Luís Fernandes & Joaquim Júdice & Hanif Sherali, 2009. "On optimal zero-preserving corrections for inconsistent linear systems," Computational Optimization and Applications, Springer, vol. 45(4), pages 645-666, December.
  22. Reiner Horst, 1990. "Deterministic methods in constrained global optimization: Some recent advances and new fields of application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 433-471, August.
  23. 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.
  24. Dominik Bongartz & Alexander Mitsos, 2017. "Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations," Journal of Global Optimization, Springer, vol. 69(4), pages 761-796, December.
  25. Nonas, Sigrid Lise & Thorstenson, Anders, 2000. "A combined cutting-stock and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 327-342, January.
  26. Takahito Kuno & Toshiyuki Masaki, 2013. "A practical but rigorous approach to sum-of-ratios optimization in geometric applications," Computational Optimization and Applications, Springer, vol. 54(1), pages 93-109, January.
  27. Vedat Verter & M. Cemal Dincer, 1995. "Facility location and capacity acquisition: An integrated approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1141-1160, December.
  28. Massol, Olivier & Banal-Estañol, Albert, 2014. "Export diversification through resource-based industrialization: The case of natural gas," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1067-1082.
  29. M. Locatelli & U. Raber, 2000. "On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 69-79, October.
  30. Takahito Kuno, 2022. "A revision of the rectangular algorithm for a class of DC optimization problems," Journal of Global Optimization, Springer, vol. 83(2), pages 187-200, June.
  31. M. Sun, 2010. "A fast memoryless interval-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 47(2), pages 247-271, June.
  32. Jiashan Wang & Yingying Kang & Changhyun Kwon & Rajan Batta, 2012. "Dual Toll Pricing for Hazardous Materials Transport with Linear Delay," Networks and Spatial Economics, Springer, vol. 12(1), pages 147-165, March.
  33. Achim Wechsung & Spencer Schaber & Paul Barton, 2014. "The cluster problem revisited," Journal of Global Optimization, Springer, vol. 58(3), pages 429-438, March.
  34. Achim Wechsung & Joseph Scott & Harry Watson & Paul Barton, 2015. "Reverse propagation of McCormick relaxations," Journal of Global Optimization, Springer, vol. 63(1), pages 1-36, September.
  35. Emmanuel Ogbe & Xiang Li, 2019. "A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 75(3), pages 595-629, November.
  36. Lemaréchal, Claude & Ouorou, Adam & Petrou, Georgios, 2010. "Robust network design in telecommunications under polytope demand uncertainty," European Journal of Operational Research, Elsevier, vol. 206(3), pages 634-641, November.
  37. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2003. "A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems," Management Science, INFORMS, vol. 49(9), pages 1268-1273, September.
  38. Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
  39. Takahito Kuno & Paul Buckland, 2012. "A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies," Journal of Global Optimization, Springer, vol. 52(3), pages 371-390, March.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.