Cardinality objective nonlinear programs for facility capacity expansion
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-025-00697-6
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- Zhongwen Chen & Yu-Hong Dai & Jiangyan Liu, 2020. "A penalty-free method with superlinear convergence for equality constrained optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 801-833, July.
- Dongdong Zhang & Shaohua Pan & Shujun Bi & Defeng Sun, 2023. "Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound," Computational Optimization and Applications, Springer, vol. 86(2), pages 627-667, November.
- POCHET, Yves & WOLSEY, Laurence A., 1988. "Lot-size models with backlogging: strong reformulations and cutting planes," LIDAM Reprints CORE 791, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jiawei Zhang & Bo Chen & Yinyu Ye, 2005. "A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 389-403, May.
- Hanan Luss, 1982. "Operations Research and Capacity Expansion Problems: A Survey," Operations Research, INFORMS, vol. 30(5), pages 907-947, October.
- Ouyang, Yanfeng & Wang, Zhaodong & Yang, Hai, 2015. "Facility location design under continuous traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 18-33.
- Mengwei Xu & Jane Ye, 2014. "A smoothing augmented Lagrangian method for solving simple bilevel programs," Computational Optimization and Applications, Springer, vol. 59(1), pages 353-377, October.
- C. Y. Wang & X. Q. Yang & X. M. Yang, 2013. "Nonlinear Augmented Lagrangian and Duality Theory," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 740-760, November.
- Wang, Xin & Ouyang, Yanfeng, 2013. "A continuum approximation approach to competitive facility location design under facility disruption risks," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 90-103.
- David Simchi-Levi & Oded Berman, 1988. "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks," Operations Research, INFORMS, vol. 36(3), pages 478-484, June.
- Shisen Liu & Xiaojun Chen, 2023. "Lifted stationary points of sparse optimization with complementarity constraints," Computational Optimization and Applications, Springer, vol. 84(3), pages 973-1003, April.
- Yulan Liu & Shujun Bi & Shaohua Pan, 2018. "Equivalent Lipschitz surrogates for zero-norm and rank optimization problems," Journal of Global Optimization, Springer, vol. 72(4), pages 679-704, December.
- Jong-Shi Pang & Meisam Razaviyayn & Alberth Alvarado, 2017. "Computing B-Stationary Points of Nonsmooth DC Programs," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 95-118, January.
- Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.
- Kochman, G. A. & McCallum, C. J., 1981. "Facility location models for planning a transatlantic communications network," European Journal of Operational Research, Elsevier, vol. 6(2), pages 205-211, February.
- Leon S. Lasdon & Allan D. Waren, 1980. "Feature Article—Survey of Nonlinear Programming Applications," Operations Research, INFORMS, vol. 28(5), pages 1029-1073, 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.- Li, Gao-Xi & Ren, Yi & Yi, Peiru, 2025. "Sparse facility location and network design problems," Omega, Elsevier, vol. 136(C).
- Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
- Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
- An, Shi & Cui, Na & Bai, Yun & Xie, Weijun & Chen, Mingliu & Ouyang, Yanfeng, 2015. "Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 199-216.
- Kai Chen & Ling Liang & Shaohua Pan, 2025. "Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate," Journal of Global Optimization, Springer, vol. 92(3), pages 775-807, July.
- Dongdong Zhang & Shaohua Pan & Shujun Bi & Defeng Sun, 2023. "Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound," Computational Optimization and Applications, Springer, vol. 86(2), pages 627-667, November.
- Klose, Andreas & Drexl, Andreas, 2001. "Lower bounds for the capacitated facility location problem based on column generation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 544, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Yun, Lifen & Fan, Hongqiang & Li, Xiaopeng, 2019. "Reliable facility location design with round-trip transportation under imperfect information part II: A continuous model," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 44-59.
- Li, Xiaopeng & Ma, Jiaqi & Cui, Jianxun & Ghiasi, Amir & Zhou, Fang, 2016. "Design framework of large-scale one-way electric vehicle sharing systems: A continuum approximation model," Transportation Research Part B: Methodological, Elsevier, vol. 88(C), pages 21-45.
- İlker Baybars & Richard H. Edahl, 1988. "A heuristic method for facility planning in telecommunications networks with multiple alternate routes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 503-528, August.
- Fan, Hongqiang & Yun, Lifen & Li, Xiaopeng, 2022. "A linear-time crystal-growth algorithm for discretization of continuum approximation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
- Yu, Guodong & Zhang, Jie, 2018. "Multi-dual decomposition solution for risk-averse facility location problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 70-89.
- Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Andreas Klose & Andreas Drexl, 2005. "Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation," Management Science, INFORMS, vol. 51(11), pages 1689-1705, November.
- Jodlbauer, Herbert & Altendorfer, Klaus, 2010. "Trade-off between capacity invested and inventory needed," European Journal of Operational Research, Elsevier, vol. 203(1), pages 118-133, May.
- Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
- Petersen, E. R. & Taylor, A. J., 2001. "An investment planning model for a new North-Central railway in Brazil," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(9), pages 847-862, November.
- Xiang Li & Tianyu Zhang & Liang Wang & Hongguang Ma & Xiande Zhao, 2022. "A minimax regret model for the leader–follower facility location problem," Annals of Operations Research, Springer, vol. 309(2), pages 861-882, February.
- Silvia Berra & Alessandro Torraca & Federico Benvenuto & Sara Sommariva, 2024. "Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 404-427, January.
- Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang, 2018. "A local search approximation algorithm for a squared metric k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1168-1184, May.
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:coopap:v:92:y:2025:i:1:d:10.1007_s10589-025-00697-6. 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.
Printed from https://ideas.repec.org/a/spr/coopap/v92y2025i1d10.1007_s10589-025-00697-6.html