{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:08:46Z","timestamp":1760854126269,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T00:00:00Z","timestamp":1590710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T00:00:00Z","timestamp":1590710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s11590-020-01590-3","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:02:55Z","timestamp":1590771775000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A note on solving DiDi\u2019s driver-order matching problem"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3256-9336","authenticated-orcid":false,"given":"Yanchao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"issue":"2","key":"1590_CR1","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.011","journal-title":"Discrete Optim."},{"issue":"2","key":"1590_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"1590_CR3","first-page":"1","volume-title":"Mixed Integer Nonlinear Programming","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 1\u201339. Springer, New York (2012)"},{"key":"1590_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization, 1st edn. Cambridge University Press, Cambridge (2004)","edition":"1"},{"issue":"2","key":"1590_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.sorms.2012.08.001","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012). https:\/\/doi.org\/10.1016\/j.sorms.2012.08.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"1590_CR6","unstructured":"Bussieck, M.R., Drud, A.: Sbb: a new solver for mixed integer nonlinear programming, Talk, OR (2001)"},{"key":"1590_CR7","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: Large-Scale Nonlinear Optimization, Springer, pp. 35\u201359 (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"issue":"6","key":"1590_CR8","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011). https:\/\/doi.org\/10.1137\/080733991","journal-title":"SIAM J. Comput."},{"key":"1590_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-30850-5_9","volume-title":"Exp. Algorithms","author":"A Costa","year":"2012","unstructured":"Costa, A., Liberti, L.: Relaxations of multilinear convex envelopes: dual is better than primal. In: Klasing, R. (ed.) Exp. Algorithms, pp. 87\u201398. Springer, Berlin (2012)"},{"issue":"2","key":"1590_CR10","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1590_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02591747","volume":"31","author":"A Drud","year":"1985","unstructured":"Drud, A.: CONOPT: a GRG code for large sparse dynamic nonlinear optimization problems. Math. Program. 31(2), 153\u2013191 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"1590_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT: a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"1590_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"issue":"1\u20133","key":"1590_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008636318275","volume":"12","author":"MC Ferris","year":"1999","unstructured":"Ferris, M.C., Munson, T.S.: Interfaces to PATH 3.0: design, implementation and usage. Comput. Optim. Appl. 12(1\u20133), 207\u2013227 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"1590_CR15","doi-asserted-by":"publisher","unstructured":"Filmus, Y., Ward, J.: A tight combinatorial algorithm for submodular maximization subject to a matroid constraint. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 659\u2013668 (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.55","DOI":"10.1109\/FOCS.2012.55"},{"key":"1590_CR16","unstructured":"Grossmann, I.E., Viswanathan, J., Vecchietti, A., Raman, R., Kalvelagen, E., et\u00a0al.: GAMS\/DICOPT: a discrete continuous optimization package. GAMS Corporation Inc, pp. 0885\u20138950 (2002)"},{"issue":"3","key":"1590_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0138-5","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1590_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0098-1354(89)85008-2","volume":"13","author":"GR Kocis","year":"1989","unstructured":"Kocis, G.R., Grossmann, I.E.: Computational experience with DICOPT solving MINLP problems in process systems engineering. Comput. Chem. Eng. 13(3), 307\u2013315 (1989)","journal-title":"Comput. Chem. Eng."},{"key":"1590_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-018-9411-8","author":"J Kronqvist","year":"2018","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex minlp. Optim. Eng. (2018). https:\/\/doi.org\/10.1007\/s11081-018-9411-8","journal-title":"Optim. Eng."},{"key":"1590_CR20","doi-asserted-by":"publisher","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: Proceedings of the 3rd ACM Conference on Electronic Commerce, EC \u201901, ACM, New York, pp. 18\u201328 (2001). https:\/\/doi.org\/10.1145\/501158.501161","DOI":"10.1145\/501158.501161"},{"issue":"4\u20135","key":"1590_CR21","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1590_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136, 325\u2013351 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0606-z","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1590_CR23","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"1590_CR24","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978). http:\/\/www.jstor.org\/stable\/3689488","DOI":"10.1287\/moor.3.3.177"},{"issue":"1","key":"1590_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014i. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"1590_CR26","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"1590_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"1590_CR28","doi-asserted-by":"publisher","unstructured":"Ross, S.: I-finite-stage models. In: Ross, S. (ed.) Introduction to Stochastic Dynamic Programming, Probability and Mathematical Statistics: A Series of Monographs and Textbooks, Academic Press, pp. 1 \u2013 27 (1983). https:\/\/doi.org\/10.1016\/B978-0-12-598420-1.50005-2","DOI":"10.1016\/B978-0-12-598420-1.50005-2"},{"issue":"2","key":"1590_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1590_CR30","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. ACTA Math. Vietnam. 22(1), 245\u2013270 (1997)","journal-title":"ACTA Math. Vietnam."},{"key":"1590_CR31","doi-asserted-by":"publisher","unstructured":"Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC \u201908, ACM, New York, NY, pp. 67\u201374 (2008). https:\/\/doi.org\/10.1145\/1374376.1374389","DOI":"10.1145\/1374376.1374389"},{"key":"1590_CR32","unstructured":"Vondr\u00e1k, J.: CS 369P: Polyhedral techniques in combinatorial optimization (2010). https:\/\/theory.stanford.edu\/~jvondrak\/CS369P\/lec17.pdf"},{"issue":"1","key":"1590_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"key":"1590_CR34","doi-asserted-by":"publisher","unstructured":"Zhang, L., Hu, T., Min, Y., Wu, G., Zhang, J., Feng, P., Gong, P., Ye, J.: A taxi order dispatch model based on combinatorial optimization. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201917, ACM, New York, NY, USA, pp. 2151\u20132159 (2017). https:\/\/doi.org\/10.1145\/3097983.3098138","DOI":"10.1145\/3097983.3098138"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01590-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01590-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01590-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T23:59:37Z","timestamp":1622246377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01590-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,29]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1590"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01590-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,5,29]]},"assertion":[{"value":"21 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}