{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:46Z","timestamp":1725488986139},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_8","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"53-59","source":"Crossref","is-referenced-by-count":1,"title":["Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods"],"prefix":"10.1007","author":[{"given":"Felix G.","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"F. Babonneau, C. Beltran, A. Haurie, C. Tadonki, and J.-P. Vial. Proximal-ACCPM: A versatile oracle based optimization method. Computational Management Science, to appear.","key":"8_CR1"},{"unstructured":"F. Babonneau and J.-P. Vial. ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Mathematical Programming, to appear.","key":"8_CR2"},{"unstructured":"O. du Merle and J.-P. Vial. Proximal-ACCPM, a cutting plane method for column generation and lagrangian relaxation: Application to the p-median problem. Technical Report 2002.23, Logilab, University of Geneva, 2002.","key":"8_CR3"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"J.-L. Goffin, A. Haurie, and J.-P. Vial. Decomposition and nondifferentiable optimization with the projective algorithm. Management Science, 38(2):284\u2013302, 1992.","journal-title":"Management Science"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O. Jahn","year":"2005","unstructured":"O. Jahn, R. H. M\u00f6hring, A. S. Schulz, and N. E. Stier-Moses. System-optimal routing of traffic flows with user constraints in networks with congestion. Operations Research, 53:600\u2013616, 2005.","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"E. K\u00f6hler, R. H. M\u00f6hring, and H. Schilling. Acceleration of shortest path and constrained shortest path computation. In Proceedings of the WEA 2005, pages 126\u2013138, 2005.","key":"8_CR6","DOI":"10.1007\/11427186_13"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:35Z","timestamp":1605762395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_8","relation":{},"subject":[]}}