{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:59:41Z","timestamp":1763535581958,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10589-019-00070-4","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:27:26Z","timestamp":1548775646000},"page":"101-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph-based algorithms for the efficient solution of optimization problems involving monotone functions"],"prefix":"10.1007","volume":"73","author":[{"given":"Luca","family":"Consolini","sequence":"first","affiliation":[]},{"given":"Mattia","family":"Laurini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"issue":"4","key":"70_CR1","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/TSMCB.2008.926614","volume":"38","author":"A Al-Tamimi","year":"2008","unstructured":"Al-Tamimi, A., Lewis, F.L., Abu-Khalaf, M.: Discrete-time nonlinear HJB solution using approximate dynamic programming: convergence proof. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 38(4), 943\u2013949 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"key":"70_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"70_CR3","volume-title":"Optimal Control and Viscosity Solutions of Hamilton\u2013Jacobi\u2013Bellman Equations","author":"M Bardi","year":"2008","unstructured":"Bardi, M., Capuzzo-Dolcetta, I.: Optimal Control and Viscosity Solutions of Hamilton\u2013Jacobi\u2013Bellman Equations. Springer, Berlin (2008)"},{"issue":"4\u20135","key":"70_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"70_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10589-017-9978-6","volume":"70","author":"F Cabassi","year":"2018","unstructured":"Cabassi, F., Consolini, L., Locatelli, M.: Time-optimal velocity planning by a bound-tightening technique. Comput. Optim. Appl. 70(1), 61\u201390 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"70_CR6","unstructured":"Consolini, L., Locatelli, M., Minari, A., Nagy, A., Vajk, I.: Optimal time-complexity speed planning for robot manipulators. CoRR (2018). \n                    arXiv:1802.03294"},{"key":"70_CR7","doi-asserted-by":"crossref","unstructured":"Consolini, L., Locatelli, M., Minari, A., Piazzi, A.: A linear-time algorithm for minimum-time velocity planning of autonomous vehicles. In: Proceedings of the 24th Mediterranean Conference on Control and Automation (MED), IEEE (2016)","DOI":"10.1109\/MED.2016.7536010"},{"key":"70_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.sysconle.2017.02.001","volume":"103","author":"L Consolini","year":"2017","unstructured":"Consolini, L., Locatelli, M., Minari, A., Piazzi, A.: An optimal complexity algorithm for minimum-time velocity planning. Syst. Control Lett. 103, 50\u201357 (2017)","journal-title":"Syst. Control Lett."},{"key":"70_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B Davey","year":"2002","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"70_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21593-8","volume-title":"Fixed Point Theory. Springer Monographs in Mathematics","author":"A Granas","year":"2003","unstructured":"Granas, A., Dugundji, J.: Fixed Point Theory. Springer Monographs in Mathematics. Springer, Berlin (2003)"},{"key":"70_CR11","unstructured":"Hagberg, A. A., Schult, D. A., Swart, P. J.: Exploring network structure, dynamics, and function using networkx. In Varoquaux, G., Vaught, T., Millman, J. (eds), Proceedings of the 7th Python in Science Conference (SciPy2008), pp. 11\u201315 (2008)"},{"key":"70_CR12","unstructured":"Heinonen, J.: Lectures on Lipschitz Analysis. Bericht (Jyv\u00e4skyl\u00e4n yliopisto. Matematiikan ja tilastotieteen laitos). University of Jyv\u00e4skyl\u00e4 (2005)"},{"issue":"026107","key":"70_CR13","first-page":"1","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E 65(026107), 1\u20134 (2002)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"70_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(77)90002-3","volume":"6","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: A generalization of Dijkstra\u2019s algorithm. Inf. Process. Lett. 6(1), 1\u20135 (1976)","journal-title":"Inf. Process. Lett."},{"key":"70_CR15","doi-asserted-by":"crossref","unstructured":"Laurini, M., Micelli, P., Consolini, L., Locatelli, M.: A Jacobi-like acceleration for dynamic programming. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 7371\u20137376 (2016)","DOI":"10.1109\/CDC.2016.7799408"},{"issue":"2","key":"70_CR16","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1109\/TSMCB.2012.2216523","volume":"43","author":"D Liu","year":"2013","unstructured":"Liu, D., Wei, Q.: Finite-approximation-error-based optimal control approach for discrete-time nonlinear systems. IEEE Trans. Cybern. 43(2), 779\u2013789 (2013)","journal-title":"IEEE Trans. Cybern."},{"issue":"4\u20136","key":"70_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0375-9601(99)00757-4","volume":"263","author":"MEJ Newman","year":"1999","unstructured":"Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263(4\u20136), 341\u2013346 (1999)","journal-title":"Phys. Lett. A"},{"issue":"2","key":"70_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/imamci\/17.2.167","volume":"17","author":"S Wang","year":"2000","unstructured":"Wang, S., Gao, F., Teo, K.L.: An upwind finite-difference method for the approximation of viscosity solutions to Hamilton\u2013Jacobi\u2013Bellman equations. IMA J. Math. Control Inf. 17(2), 167\u2013178 (2000)","journal-title":"IMA J. Math. Control Inf."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00070-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00070-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00070-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:07:30Z","timestamp":1580238450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00070-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00070-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"4 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}