{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:55Z","timestamp":1742913535779,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53262-8_19","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-Separable Dantzig-Wolfe Reformulations for Network Design"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Frangioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Gorgone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2018.07.003","volume":"261","author":"B Gendron","year":"2019","unstructured":"Gendron, B.: Revisiting Lagrangian relaxation for network design. Discrete Appl. Math. 261, 203\u2013218 (2019)","journal-title":"Discrete Appl. Math."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"TG Crainic","year":"2001","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112, 73\u201399 (2001)","journal-title":"Discrete Appl. Math."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10107-013-0642-3","volume":"145","author":"A Frangioni","year":"2014","unstructured":"Frangioni, A., Gorgone, E.: Bundle methods for sum-functions with \u201ceasy\u201d components: applications to multicommodity network design. Math. Program. A 145, 133\u2013161 (2014)","journal-title":"Math. Program. A"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1287\/opre.46.2.247","volume":"46","author":"K Holmberg","year":"1998","unstructured":"Holmberg, K., Hellstrand, J.: Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound. Oper. Res. 46, 247\u2013259 (1998)","journal-title":"Oper. Res."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48, 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11561071_7","volume-title":"Algorithms \u2013 ESA 2005","author":"G Kliewer","year":"2005","unstructured":"Kliewer, G., Timajev, L.: Relax-and-cut for capacitated network design. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 47\u201358. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_7"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/3-540-45749-6_73","volume-title":"Algorithms\u2014ESA 2002","author":"M Sellmann","year":"2002","unstructured":"Sellmann, M., Kliewe, G., Koberstein, A.: Lagrangian cardinality cuts and variable fixing for capacitated network design. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 845\u2013858. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_73"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangean relaxation for integer programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10107-012-0626-8","volume":"140","author":"A Frangioni","year":"2013","unstructured":"Frangioni, A., Gendron, B.: A stabilized structured Dantzig-Wolfe decomposition method. Math. Program. B 140, 45\u201376 (2013)","journal-title":"Math. Program. B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:09:17Z","timestamp":1710266957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.26","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}