{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:51:50Z","timestamp":1744203110904},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,30]],"date-time":"2016-07-30T00:00:00Z","timestamp":1469836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00186-016-0555-z","type":"journal-article","created":{"date-parts":[[2016,7,30]],"date-time":"2016-07-30T08:19:02Z","timestamp":1469866742000},"page":"155-177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pricing and clearing combinatorial markets with singleton and swap orders"],"prefix":"10.1007","volume":"85","author":[{"given":"Johannes C.","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Pape","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Peter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Winter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,30]]},"reference":[{"key":"555_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall Inc., Englewood Cliffs, NJ"},{"issue":"3","key":"555_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/1907353","volume":"22","author":"KJ Arrow","year":"1954","unstructured":"Arrow KJ, Debreu G (1954) Existence of an equilibrium for a competitive economy. Econometrica 22(3):265\u2013290","journal-title":"Econometrica"},{"key":"555_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/CBO9780511800481.013","volume-title":"Algorithmic game theory","author":"L Blumrosen","year":"2007","unstructured":"Blumrosen L, Nisan N (2007) Combinatorial auctions. Algorithmic game theory. Cambridge University Press, Cambridge, pp 267\u2013299"},{"key":"555_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"2","key":"555_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/10556789808805709","volume":"10","author":"U B\u00fcnnagel","year":"1998","unstructured":"B\u00fcnnagel U, Korte B, Vygen J (1998) Efficient implementation of the Goldberg\u2013Tarjan minimum-cost flow algorithm. Optim Methods Softw 10(2):157\u2013174. doi:\n                        10.1080\/10556789808805709","journal-title":"Optim Methods Softw"},{"key":"555_CR6","unstructured":"Cooper CL (2015) The Blackwell encyclopedia of management, vol IV Finance. Online reference: Rollover Risk. Blackwell Publishing, \n                        http:\/\/www.blackwellreference.com\/public\/book.html?id=g9780631233176_9780631233176"},{"issue":"3","key":"555_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309. doi:\n                        10.1287\/ijoc.15.3.284.16077","journal-title":"INFORMS J Comput"},{"issue":"11","key":"555_CR8","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1080\/14697688.2013.803148","volume":"13","author":"MD Gould","year":"2013","unstructured":"Gould MD, Porter MA, Williams S, McDonald M, Fenn DJ, Howison SD (2013) Limit order books. Quant Finance 13(11):1709\u20131742. doi:\n                        10.1080\/14697688.2013.803148","journal-title":"Quant Finance"},{"key":"555_CR9","unstructured":"Hoffman AJ, Kruskal JB (1956) Integral boundary points of convex polyhedra. In: Linear inequalities and related systems, annals of mathematics studies, no. 38, Princeton University Press, Princeton, NJ, pp 223\u2013246"},{"key":"555_CR10","volume-title":"Options, futures, and other derivatives","author":"JC Hull","year":"2006","unstructured":"Hull JC (2006) Options, futures, and other derivatives, 6th edn. Prentice Hall, New Jersey","edition":"6"},{"issue":"1","key":"555_CR11","first-page":"67","volume":"4","author":"Z Kir\u00e1ly","year":"2012","unstructured":"Kir\u00e1ly Z, Kov\u00e1cs P (2012) Efficient implementations of minimum-cost flow algorithms. Acta Univ Sapientiae Inform 4(1):67\u2013118 \n                        arXiv:1207.6381","journal-title":"Acta Univ Sapientiae Inform"},{"key":"555_CR12","unstructured":"Lemon (2014) Library for efficient modeling and optimization in networks. Version: 1.3. \n                        http:\/\/lemon.cs.elte.hu"},{"issue":"1","key":"555_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/10556788.2013.823544","volume":"29","author":"A Martin","year":"2014","unstructured":"Martin A, M\u00fcller JC, Pokutta S (2014) Strict linear prices in non-convex European day-ahead electricity markets. Optim Methods Softw 29(1):189\u2013221. doi:\n                        10.1080\/10556788.2013.823544\n                        \n                    . \n                        arXiv:1203.4177","journal-title":"Optim Methods Softw"},{"key":"555_CR14","volume-title":"Microeconomic theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell A, Whinston MD, Green JR (1995) Microeconomic theory. Oxford University Press, New York"},{"key":"555_CR15","doi-asserted-by":"publisher","unstructured":"M\u00fcller JC (2014) Auctions in exchange trading systems: modeling techniques and algorithms. PhD thesis, University of Erlangen-Nuremberg, doi:\n                        10.13140\/2.1.1621.8405\n                        \n                    , urn:nbn:de:bvb:29-opus4-53396","DOI":"10.13140\/2.1.1621.8405"},{"key":"555_CR16","doi-asserted-by":"publisher","unstructured":"Orlin JB (1997) A polynomial time primal network simplex algorithm for minimum cost flows. Math Programming 78(2, Ser. B):109\u2013129, doi:\n                        10.1007\/BF02614365\n                        \n                    , network optimization: algorithms and applications (San Miniato, 1993)","DOI":"10.1007\/BF02614365"},{"key":"555_CR17","unstructured":"Winter T, Rudel M, Lalla H, Brendgen S, Gei\u00dfler B, Martin A, Morsi A (2011) System and method for performing an opening auction of a derivative. \n                        https:\/\/www.google.de\/patents\/US20110119170\n                        \n                    , Pub. No.: US 2011\/0119170 A1. US Patent App. 12\/618,410"},{"key":"555_CR18","unstructured":"Winter T, M\u00fcller JC, Martin A, Pape S, Peter A, Pokutta S (2014) Method and system for performing an opening auction of a derivative. \n                        http:\/\/www.google.com\/patents\/US20140372275\n                        \n                    , Pub. No.: US 2014\/0372275 A1. US Patent App. 13\/920,041"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-016-0555-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0555-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0555-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-016-0555-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T12:04:38Z","timestamp":1499947478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-016-0555-z"}},"subtitle":["Efficient algorithms for the futures opening auction problem"],"short-title":[],"issued":{"date-parts":[[2016,7,30]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["555"],"URL":"https:\/\/doi.org\/10.1007\/s00186-016-0555-z","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,30]]}}}