{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T04:42:44Z","timestamp":1781930564576,"version":"3.54.5"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science and Technology","award":["109-2410-H-030-037-MY3"],"award-info":[{"award-number":["109-2410-H-030-037-MY3"]}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"crossref","award":["107-2410-H-030-031-MY2"],"award-info":[{"award-number":["107-2410-H-030-031-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"crossref","award":["109-2912-I-030-501"],"award-info":[{"award-number":["109-2912-I-030-501"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10589-021-00285-4","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T16:46:55Z","timestamp":1622566015000},"page":"601-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An effective logarithmic formulation for piecewise linearization requiring no inequality constraint"],"prefix":"10.1007","volume":"79","author":[{"given":"F. J.","family":"Hwang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0562-5117","authenticated-orcid":false,"given":"Yao-Huei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,1]]},"reference":[{"issue":"2","key":"285_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(92)00168-L","volume":"50","author":"EH Aghezzaf","year":"1994","unstructured":"Aghezzaf, E.H., Wolsey, L.A.: Modelling piecewise linear concave costs in a tree partitioning problem. Discrete Appl. Math. 50(2), 101\u2013109 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"285_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/net.3230190202","volume":"19","author":"A Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Graves, S.: A composite algorithm for a concave-cost network flow problem. Networks 19(2), 175\u2013202 (1989)","journal-title":"Networks"},{"key":"285_CR3","volume-title":"Nonlinear Programming Theory and Algorithms","author":"MS Bazaraa","year":"1993","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Theory and Algorithms, 2nd edn. Wiley, New York (1993)","edition":"2"},{"key":"285_CR4","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the Fifth International Conference on Operational Research, pp. 447\u2013454. Tavistock Publications, London (1970)"},{"key":"285_CR5","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific Belmont, Massachusetts (1997)"},{"issue":"3","key":"285_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated network design polyhedral structure and computation. INFORMS J. Comput. 8(3), 243\u2013259 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"285_CR7","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1287\/opre.50.6.1058.350","volume":"50","author":"LMA Chan","year":"2002","unstructured":"Chan, L.M.A., Muriel, A., Shen, Z.J., Simchi-Levi, D.: On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures. Oper. Res. 50(6), 1058\u20131067 (2002)","journal-title":"Oper. Res."},{"issue":"11","key":"285_CR8","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.1287\/mnsc.48.11.1446.267","volume":"48","author":"LMA Chan","year":"2002","unstructured":"Chan, L.M.A., Muriel, A., Shen, Z.J., Simchi-Levi, D., Teo, C.P.: Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Manag. Sci. 48(11), 1446\u20131460 (2002)","journal-title":"Manag. Sci."},{"key":"285_CR9","unstructured":"Croxton, K.L.: Modeling and Solving Network Flow Problems with Piecewise Linear Costs, with Applications in Supply Chain Management, Ph.D. thesis. Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts (1999)"},{"issue":"1","key":"285_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.37.1.1.12822","volume":"37","author":"KL Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: Models and methods for merge-in-transit operations. Transp. Sci. 37(1), 1\u201322 (2003)","journal-title":"Transp. Sci."},{"issue":"1","key":"285_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/opre.1060.0314","volume":"55","author":"KL Croxton","year":"2007","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: Variable disaggregation in network flow problems with piecewise linear costs. Oper. Res. 55(1), 146\u2013157 (2007)","journal-title":"Oper. Res."},{"issue":"1","key":"285_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.2307\/1905292","volume":"28","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B.: On the significance of solving linear-programming problems with some integer variables. Econometrica 28(1), 30\u201344 (1960)","journal-title":"Econometrica"},{"issue":"1","key":"285_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(99)00020-6","volume":"25","author":"V Gabrel","year":"1999","unstructured":"Gabrel, V., Knippel, A., Minoux, M.: Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25(1), 15\u201323 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"9\u201310","key":"285_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(90)90111-V","volume":"20","author":"T Graf","year":"1990","unstructured":"Graf, T., Van Hentenryck, P., Pradelles-Lasserre, C., Zimmer, L.: Simulation of hybrid circuits in constraint logic programming. Comput. Math. Appl. 20(9\u201310), 45\u201356 (1990)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"285_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck, O.: A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86(1), 17\u201339 (1999)","journal-title":"Math. Program."},{"key":"285_CR16","volume-title":"Introduction to Operations Research","author":"FS Hillier","year":"1995","unstructured":"Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research, 6th edn. McGraw-Hill, New York (1995)","edition":"6"},{"issue":"1","key":"285_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0377-2217(94)90184-8","volume":"75","author":"K Holmberg","year":"1994","unstructured":"Holmberg, K.: Solving the staircase cost facility location problem with decomposition and piecewise linearization. Eur. J. Oper. Res. 75(1), 41\u201361 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"285_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0377-2217(96)00058-6","volume":"97","author":"K Holmberg","year":"1997","unstructured":"Holmberg, K., Ling, J.: A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. 97(1), 63\u201374 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"285_CR19","unstructured":"Huang, Y.H., Li, H.L.: A note on logarithmic method for non-separable function. NCTU Research Report OPTL-D-10-00325: 1\u201317 (2010)"},{"issue":"10","key":"285_CR20","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1080\/0305215X.2017.1411484","volume":"50","author":"YH Huang","year":"2018","unstructured":"Huang, Y.H., Hwang, F.J.: Global optimization for the three-dimensional open-dimension rectangular packing problem. Eng. Optim. 50(10), 1789\u20131809 (2018)","journal-title":"Eng. Optim."},{"key":"285_CR21","doi-asserted-by":"crossref","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. In: Mathematical Programming at Oberwolfach II: Mathematical Programming Studies, vol. 22. Springer, Berlin (1984)","DOI":"10.1007\/BFb0121015"},{"issue":"1","key":"285_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/mnsc.36.1.115","volume":"36","author":"O Kettani","year":"1990","unstructured":"Kettani, O., Oral, M.: Equivalent formulations of nonlinear integer problems for efficient optimization. Manag. Sci. 36(1), 115\u2013119 (1990)","journal-title":"Manag. Sci."},{"issue":"2","key":"285_CR23","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF02190009","volume":"90","author":"HL Li","year":"1996","unstructured":"Li, H.L.: An efficient method for solving linear goal programming problems. J. Optim. Theory Appl. 90(2), 465\u2013469 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"285_CR24","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/S0377-2217(97)00072-6","volume":"105","author":"HL Li","year":"1998","unstructured":"Li, H.L., Chang, C.T.: An approximately global optimization method for assortment problems. Eur. J. Oper. Res. 105(3), 604\u2013612 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"285_CR25","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/S0377-2217(01)00194-1","volume":"140","author":"HL Li","year":"2002","unstructured":"Li, H.L., Chang, C.T., Tsai, J.F.: Approximately global optimization for assortment problems using piecewise linearization techniques. Eur. J. Oper. Res. 140(3), 584\u2013589 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"285_CR26","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.ejor.2016.05.063","volume":"255","author":"HL Li","year":"2016","unstructured":"Li, H.L., Fang, S.C., Huang, Y.H., Nie, T.: An enhanced logarithmic method for signomial programming with discrete variables. Eur. J. Oper. Res. 255(3), 922\u2013934 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"285_CR27","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/ijoc.1120.0527","volume":"25","author":"HL Li","year":"2013","unstructured":"Li, H.L., Huang, Y.H., Fang, S.C.: A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems. INFORMS J. Comput. 25(4), 643\u2013653 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"285_CR28","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/ijoc.1080.0294","volume":"21","author":"HL Li","year":"2009","unstructured":"Li, H.L., Lu, H.C., Huang, C.H., Hu, N.Z.: A superior representation method for piecewise linear functions. INFORMS J. Comput. 21(2), 314\u2013321 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"285_CR29","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0377-2217(98)00243-4","volume":"117","author":"HL Li","year":"1999","unstructured":"Li, H.L., Yu, C.S.: Global optimization method for nonconvex separable programming problems. Eur. J. Oper. Res. 117(2), 275\u2013292 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"285_CR30","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1080\/0305215X.2013.806918","volume":"46","author":"MH Lin","year":"2014","unstructured":"Lin, M.H., Tsai, J.F.: A deterministic global approach for mixed-discrete structural optimization. Eng. Optim. 46(7), 863\u2013879 (2014)","journal-title":"Eng. Optim."},{"issue":"3","key":"285_CR31","first-page":"1101","volume":"6","author":"MH Lin","year":"2012","unstructured":"Lin, M.H., Tsai, J.F., Wang, P.C.: Solving engineering optimization problems by a deterministic global optimization approach. Appl. Math. Inf. Sci. 6(3), 1101\u20131107 (2012)","journal-title":"Appl. Math. Inf. Sci."},{"issue":"2","key":"285_CR32","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10898-007-9223-4","volume":"43","author":"A Lundell","year":"2009","unstructured":"Lundell, A., Westerlund, J., Westerlund, T.: Some transformation techniques with applications in global optimization. J. Glob. Optim. 43(2), 391\u2013405 (2009)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"285_CR33","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43(1), 142\u2013157 (1995)","journal-title":"Oper. Res."},{"key":"285_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M., Manne, A.S.: On the solution of discrete programming problems. Econometrica 25, 84\u2013110 (1957)","journal-title":"Econometrica"},{"issue":"1","key":"285_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00028-6","volume":"27","author":"M Padberg","year":"2000","unstructured":"Padberg, M.: Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27(1), 1\u20135 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"285_CR36","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0167-6377(01)00063-3","volume":"28","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D.: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. 28(4), 155\u2013160 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"285_CR37","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.orl.2013.08.010","volume":"41","author":"S Sridhar","year":"2013","unstructured":"Sridhar, S., Linderoth, J., Luedtke, J.: Locally ideal formulations for piecewise linear functions with indicator variables. Oper. Res. Lett. 41(6), 627\u2013632 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"285_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00186-016-0546-0","volume":"84","author":"S Rebennack","year":"2016","unstructured":"Rebennack, S.: Computing tight bounds via piecewise linear functions through the example of circle cutting problems. Math. Methods Oper. Res. 84(1), 3\u201357 (2016)","journal-title":"Math. Methods Oper. Res."},{"issue":"10","key":"285_CR39","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/j.conengprac.2004.04.003","volume":"12","author":"J Till","year":"2004","unstructured":"Till, J., Engell, S., Panek, S., Stursberg, O.: Applied hybrid system optimization: an empirical investigation of complexity. Control Eng. Pract. 12(10), 1291\u20131303 (2004)","journal-title":"Control Eng. Pract."},{"issue":"2","key":"285_CR40","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1016\/j.ejor.2006.01.034","volume":"177","author":"JF Tsai","year":"2007","unstructured":"Tsai, J.F.: An optimization approach for supply chain management models with quantity discount policy. Eur. J. Oper. Res. 177(2), 982\u2013994 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"285_CR41","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/03052150600603264","volume":"38","author":"JF Tsai","year":"2006","unstructured":"Tsai, J.F., Li, H.L.: A global optimization method for packing problems. Eng. Optim. 38(6), 687\u2013700 (2006)","journal-title":"Eng. Optim."},{"issue":"7","key":"285_CR42","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/02331934.2011.625029","volume":"62","author":"JF Tsai","year":"2013","unstructured":"Tsai, J.F., Wang, P.C., Lin, M.H.: An efficient deterministic optimization approach for rectangular packing problems. Optimization 62(7), 989\u20131002 (2013)","journal-title":"Optimization"},{"issue":"3","key":"285_CR43","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/ijoc.1100.0379","volume":"22","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: A note on \u201ca superior representation method for piecewise linear functions\u2019\u2019. INFORMS J. Comput. 22(3), 493\u2013497 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"285_CR44","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1), 49\u201372 (2011)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00285-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00285-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00285-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T19:22:05Z","timestamp":1623957725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00285-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00285-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,1]]},"assertion":[{"value":"22 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}