{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:20:48Z","timestamp":1720297248968},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"DFG","doi-asserted-by":"publisher","award":["BI 1057\/1-8"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1016\/j.cor.2018.11.017","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T01:29:50Z","timestamp":1543282190000},"page":"277-287","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A simple and fast algorithm for convex decomposition in relax-and-round mechanisms"],"prefix":"10.1016","volume":"103","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5491-2935","authenticated-orcid":false,"given":"Martin","family":"Bichler","sequence":"first","affiliation":[]},{"given":"Salman","family":"Fadaei","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Kraft","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.cor.2018.11.017_bib0001","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1016\/S0305-0548(03)00071-6","article-title":"A new bidding framework for combinatorial e-auctions","volume":"31","author":"Abrache","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2018.11.017_bib0002","series-title":"The Handbook of Spectrum Auction Design","author":"Bichler","year":"2017"},{"issue":"6","key":"10.1016\/j.cor.2018.11.017_bib0003","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","article-title":"The ellipsoid method: a survey","volume":"29","author":"Bland","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2018.11.017_bib0004","series-title":"ACM Conference on Electronic Commerce (EC 05), Vancouver, Canada","article-title":"On the computational power of iterative auctions","author":"Blumrosen","year":"2005"},{"key":"10.1016\/j.cor.2018.11.017_bib0005","series-title":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","first-page":"39","article-title":"Approximation techniques for utilitarian mechanism design","author":"Briest","year":"2005"},{"key":"10.1016\/j.cor.2018.11.017_bib0006","unstructured":"Bundesamt fuer Gueterverkehr, 2011. Sonderbericht zur Situation an der Laderampe."},{"key":"10.1016\/j.cor.2018.11.017_bib0007","unstructured":"Bundesverband Gueterkraftverkehr Logistik und Entsorgung e.V., 2013. Jahresbericht 2012\/2013."},{"issue":"4","key":"10.1016\/j.cor.2018.11.017_bib0008","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1111\/j.1937-5956.2007.tb00270.x","article-title":"Electronic markets for truckload transportation","volume":"16","author":"Caplice","year":"2007","journal-title":"Prod. Oper. Manage."},{"key":"10.1016\/j.cor.2018.11.017_bib0009","series-title":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","first-page":"58","article-title":"Randomized metarounding","author":"Carr","year":"2000"},{"issue":"10","key":"10.1016\/j.cor.2018.11.017_bib0010","doi-asserted-by":"crossref","first-page":"2752","DOI":"10.1016\/j.cor.2008.12.006","article-title":"Solving multiple scenarios in a combinatorial auction","volume":"36","author":"Cataln","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2018.11.017_bib0011","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/ijoc.2014.0594","article-title":"A linear-programming approximation of ac power flows","volume":"26","author":"Coffrin","year":"2014","journal-title":"INFORMS J Comput"},{"key":"10.1016\/j.cor.2018.11.017_bib0012","series-title":"Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing","first-page":"401","article-title":"Inapproximability of truthful mechanisms via generalizations of the vc dimension","author":"Daniely","year":"2015"},{"key":"10.1016\/j.cor.2018.11.017_bib0013","series-title":"Technical Report","article-title":"An \u03b5-Precise Feasible Solution to a Linear Program With a Convexity Constraint in 1\/\u03b52 Iterations Independent of Problem Size","author":"Dantzig","year":"1992"},{"key":"10.1016\/j.cor.2018.11.017_bib0014","series-title":"Foundations of Computer Science, 2009. FOCS\u201909. 50th Annual IEEE Symposium on","first-page":"505","article-title":"On the power of randomization in algorithmic mechanism design","author":"Dobzinski","year":"2009"},{"issue":"4","key":"10.1016\/j.cor.2018.11.017_bib0015","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00224-016-9704-2","article-title":"Towards more practical linear programming-based techniques for algorithmic mechanism design","volume":"59","author":"Elbassioni","year":"2016","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.cor.2018.11.017_bib0016","series-title":"Geometric algorithms and combinatorial optimization","volume":"2","author":"Gr\u00f6tschel","year":"2012"},{"issue":"1","key":"10.1016\/j.cor.2018.11.017_bib0017","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","article-title":"Bundling equilibrium in combinatorial auctions","volume":"47","author":"Holzman","year":"2004","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.cor.2018.11.017_bib0018","article-title":"Coordination is hard: electronic market mechanisms for increased efficiency in transportation logistics","volume":"forthcoming","author":"Kar\u00e4nke","year":"2018","journal-title":"Manage. Sci."},{"key":"10.1016\/j.cor.2018.11.017_bib0019","series-title":"Lagrangian relaxation based algorithms for convex programming problems","author":"Khandekar","year":"2004"},{"key":"10.1016\/j.cor.2018.11.017_bib0020","series-title":"Web and Internet Economics","first-page":"120","article-title":"Fast Convex Decomposition for Truthful Social Welfare Approximation","author":"Kraft","year":"2014"},{"key":"10.1016\/j.cor.2018.11.017_bib0021","series-title":"Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on","first-page":"574","article-title":"Towards a characterization of truthful combinatorial auctions","author":"Lavi","year":"2003"},{"issue":"6","key":"10.1016\/j.cor.2018.11.017_bib0022","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2049697.2049699","article-title":"Truthful and near-optimal mechanism design via linear programming","volume":"58","author":"Lavi","year":"2011","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"10.1016\/j.cor.2018.11.017_bib0023","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1287\/ijoc.1120.0522","article-title":"Approximation algorithms for integrated distribution network design problems","volume":"25","author":"Li","year":"2013","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2018.11.017_bib0024","series-title":"Combinatorial Auctions","article-title":"Bidding Languages","author":"Nisan","year":"2006"},{"key":"10.1016\/j.cor.2018.11.017_bib0025","series-title":"Foundations of Computer Science, 2008. FOCS\u201908. IEEE 49th Annual IEEE Symposium on","first-page":"250","article-title":"On the hardness of being truthful","author":"Papadimitriou","year":"2008"},{"issue":"2","key":"10.1016\/j.cor.2018.11.017_bib0026","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/ijoc.2015.0678","article-title":"Approximation of the quadratic knapsack problem","volume":"28","author":"Pferschy","year":"2016","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2018.11.017_bib0027","series-title":"Algorithmic Game Theory","author":"Vazirani","year":"2007"},{"issue":"3","key":"10.1016\/j.cor.2018.11.017_bib0028","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","article-title":"Counterspeculation, auctions, and competitive sealed tenders","author":"Vickrey","year":"1961","journal-title":"J. Finance"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818303010?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054818303010?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T15:59:01Z","timestamp":1544803141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054818303010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":28,"alternative-id":["S0305054818303010"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2018.11.017","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A simple and fast algorithm for convex decomposition in relax-and-round mechanisms","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2018.11.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.COR.2018.11.017', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>