{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:21:43Z","timestamp":1762507303459,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T00:00:00Z","timestamp":1516752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61379048","61672508"],"award-info":[{"award-number":["61379048","61672508"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005231","name":"The CAS\/SAFEA International Partnership Program for Creative Research Teams","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005231","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10898-017-0602-1","type":"journal-article","created":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T03:09:58Z","timestamp":1516763398000},"page":"737-756","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An interleaved depth-first search method for the linear optimization problem with disjunctive constraints"],"prefix":"10.1007","volume":"70","author":[{"given":"Yinrun","family":"Lyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changyou","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dacheng","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasro","family":"Min-Allah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongji","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,24]]},"reference":[{"key":"602_CR1","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1998","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1998)"},{"key":"602_CR2","doi-asserted-by":"crossref","unstructured":"Lodi, A.: Mixed integer programming computation. In: Jnger, M., Liebling, TM., Naddef, D., Nemhauser, GL., Pulleyblank, WR., Reinelt, G., Rinaldi, G., Wolsey, LA. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_16"},{"key":"602_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"602_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96","author":"JN Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed logical-linear programming. Discrete Appl. Math. 96, 395\u2013442 (1999)","journal-title":"Discrete Appl. Math."},{"key":"602_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-017-0499-8","volume":"69","author":"L Chen","year":"2017","unstructured":"Chen, L., Lyu, Y., Wang, C., Wu, J., Zhang, C., Min-Allah, N., Alhiyafi, J., Wang, Y.: Solving linear optimization over arithmetic constraint formula. J. Glob. Optim. 69, 1\u201334 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"602_CR6","first-page":"12","volume":"16","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Log. (TOCL) 16(2), 12 (2015)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"602_CR7","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. MSRR No. 330 (1974)"},{"issue":"1","key":"602_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"602_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"602_CR10","unstructured":"Vecchietti, A., Grossmann, I.: Computational experience with LogMIP solving linear and nonlinear disjunctive programming problems. In: Proceeding of FOCAPD, pp. 587\u2013590. Citeseer (2004)"},{"issue":"1","key":"602_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2011.07.018","volume":"216","author":"N Sawaya","year":"2012","unstructured":"Sawaya, N., Grossmann, I.: A hierarchy of relaxations for linear generalized disjunctive programming. Eur. J. Oper. Res. 216(1), 70\u201382 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"602_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1287\/ijoc.2014.0610","volume":"27","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., Grossmann, I.E.: Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs. INFORMS J. Comput. 27(1), 59\u201374 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"602_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.2015.0669","volume":"28","author":"F Trespalacios","year":"2016","unstructured":"Trespalacios, F., Grossmann, I.E.: Cutting plane algorithm for convex generalized disjunctive programs. INFORMS J. Comput. 28(2), 209\u2013222 (2016)","journal-title":"INFORMS J. Comput."},{"key":"602_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-017-0526-9","volume":"69","author":"P Kirst","year":"2017","unstructured":"Kirst, P., Rigterink, F., Stein, O.: Global optimization of disjunctive programs. J. Glob. Optim. 69, 1\u201325 (2017)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"602_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10898-016-0401-0","volume":"67","author":"JP Ruiz","year":"2017","unstructured":"Ruiz, J.P., Grossmann, I.E.: Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques. J. Glob. Optim. 67(1), 43\u201358 (2017)","journal-title":"J. Glob. Optim."},{"key":"602_CR16","unstructured":"Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H. (eds.) Handbook of Satisfiability, vol. 185, pp. 825\u2013885. IOS Press (2009)"},{"issue":"9","key":"602_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"L Moura De","year":"2011","unstructured":"De Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"602_CR18","doi-asserted-by":"crossref","unstructured":"Monniaux, D.: A survey of satisfiability modulo theory. In: International Workshop on Computer Algebra in Scientific Computing, pp. 401\u2013425. Springer (2016)","DOI":"10.1007\/978-3-319-45641-6_26"},{"key":"602_CR19","unstructured":"Silva, J.P.M., and Sakallah, K.A.: GRASP: a new search algorithm for satisfiability. In: Proceedings of the 1996 IEEE\/ACM International Conference on Computer-Aided Design, pp. 220\u2013227. IEEE Computer Society (1997)"},{"key":"602_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"602_CR21","unstructured":"Gomes, C.P., Selman, B., Kautz, H., et al.: Boosting combinatorial search through randomization. In: AAAI\/IAAI, vol. 98, pp. 431\u2013437 (1998)"},{"issue":"12","key":"602_CR22","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.dam.2006.10.007","volume":"155","author":"E Goldberg","year":"2007","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: a fast and robust sat-solver. Discrete Appl. Math. 155(12), 1549\u20131561 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"602_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"JN Hooker","year":"2002","unstructured":"Hooker, J.N.: Logic, optimization, and constraint programming. INFORMS J. Comput. 14(4), 295\u2013321 (2002)","journal-title":"INFORMS J. Comput."},{"key":"602_CR24","unstructured":"Meseguer, P.: Interleaved depth-first search. In: IJCAI, vol. 97, pp. 1382\u20131387 (1997)"},{"issue":"3","key":"602_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293\u2013304 (1986)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"602_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0747-7171(92)90009-S","volume":"14","author":"TB de la Tour","year":"1992","unstructured":"de la Tour, T.B.: An optimality result for clause form translation. J. Symb. Comput. 14(4), 283\u2013301 (1992)","journal-title":"J. Symb. Comput."},{"key":"602_CR27","doi-asserted-by":"crossref","unstructured":"Li, Y., Albarghouthi, A., Kincaid, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: ACM SIGPLAN Notices, vol. 49, pp. 607\u2013618. ACM (2014)","DOI":"10.1145\/2535838.2535857"},{"key":"602_CR28","doi-asserted-by":"crossref","unstructured":"Sebastiani, R., Tomasi, S.: Optimization in SMT with $${\\cal{LA}}({\\mathbb{Q}})$$ LA ( Q ) cost functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) Automated Reasoning, pp. 484\u2013498. Springer (2012)","DOI":"10.1007\/978-3-642-31365-3_38"},{"issue":"9","key":"602_CR29","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/j.compchemeng.2005.04.004","volume":"29","author":"NW Sawaya","year":"2005","unstructured":"Sawaya, N.W., Grossmann, I.E.: A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chem. Eng. 29(9), 1891\u20131913 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"602_CR30","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compchemeng.2015.02.013","volume":"76","author":"F Trespalacios","year":"2015","unstructured":"Trespalacios, F., Grossmann, I.E.: Improved Big-M reformulation for generalized disjunctive programs. Comput. Chem. Eng. 76, 98\u2013103 (2015)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"602_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"issue":"7","key":"602_CR32","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1360\/jos171641","volume":"17","author":"J Liu","year":"2006","unstructured":"Liu, J., Wang, Y., Wang, Y., Xing, J., Zeng, H.: Real-time system design based on logic or constrained optimization. J. Softw. 17(7), 1641\u20131649 (2006)","journal-title":"J. Softw."},{"issue":"1","key":"602_CR33","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46\u201361 (1973)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"602_CR34","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1007\/s11227-010-0506-z","volume":"59","author":"N Min-Allah","year":"2012","unstructured":"Min-Allah, N., Khan, S.U., Yongji, W.: Optimal task execution times for periodic tasks using nonlinear constrained optimization. J. Supercomput. 59(3), 1120\u20131138 (2012)","journal-title":"J. Supercomput."},{"key":"602_CR35","doi-asserted-by":"crossref","unstructured":"Bini, E., Buttazzo, G.C.: The space of rate monotonic schedulability. In: 23rd IEEE on Real-Time Systems Symposium, 2002. RTSS 2002, pp. 169\u2013178. IEEE (2002)","DOI":"10.1109\/REAL.2002.1181572"},{"issue":"1","key":"602_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0165-0114(97)00184-X","volume":"103","author":"S Fang","year":"1999","unstructured":"Fang, S., Li, G.: Solving fuzzy relation equations with a linear objective function. Fuzzy Sets Syst. 103(1), 107\u2013113 (1999)","journal-title":"Fuzzy Sets Syst."},{"issue":"2","key":"602_CR37","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ins.2007.07.022","volume":"178","author":"A Ghodousian","year":"2008","unstructured":"Ghodousian, A., Khorram, E.: Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max\u2013min composition. Inf. Sci. 178(2), 501\u2013519 (2008)","journal-title":"Inf. Sci."},{"key":"602_CR38","doi-asserted-by":"crossref","unstructured":"Su, C., Guo, F.: Solving interval-valued fuzzy relation equations with a linear objective function. In: International Conference on Fuzzy Systems and Knowledge Discovery, pp. 380\u2013385 (2009)","DOI":"10.1109\/FSKD.2009.558"},{"key":"602_CR39","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ins.2011.09.030","volume":"252","author":"F Guo","year":"2013","unstructured":"Guo, F., Pang, L., Meng, D., Xia, Z.: An algorithm for solving optimization problems with fuzzy relational inequality constraints. Inf. Sci. 252, 20\u201331 (2013)","journal-title":"Inf. Sci."},{"key":"602_CR40","doi-asserted-by":"crossref","unstructured":"Miyagi, H., Kinjo, I., Fan, Y.: Qualified decision-making using the fuzzy relation inequalities. In: IEEE International Conference on Systems, Man, and Cybernetics, vol. 2, pp. 2014\u20132018 (1998)","DOI":"10.1109\/ICSMC.1998.728193"},{"issue":"7","key":"602_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0898-1221(98)00170-9","volume":"36","author":"H Wang","year":"1998","unstructured":"Wang, H., Wang, C.H.: A fixed-charge model with fuzzy inequality constraints composed by max-product operator. Comput. Math. Appl. 36(7), 23\u201329 (1998)","journal-title":"Comput. Math. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0602-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T14:52:42Z","timestamp":1570632762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0602-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,24]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["602"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0602-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,1,24]]},"assertion":[{"value":"26 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}