{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T10:10:30Z","timestamp":1725271830420},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00186-024-00874-z","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T18:03:34Z","timestamp":1724436214000},"page":"1-4","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Special issue on exact and approximation methods for mixed-integer multi-objective optimization"],"prefix":"10.1007","volume":"100","author":[{"given":"Carlos Henggeler","family":"Antunes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stiglmayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,23]]},"reference":[{"key":"874_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-024-00854-3","author":"J Bau\u00df","year":"2024","unstructured":"Bau\u00df J, Stiglmayr M (2024) Augmenting bi-objective branch and bound by scalarization-based information. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-024-00854-3","journal-title":"Math Meth Oper Res"},{"key":"874_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00836-x","author":"C Bazgan","year":"2023","unstructured":"Bazgan C, Herzel A, Ruzika S, Thielen C, Vanderpooten D (2023) Approximating multiobjective optimization problems: how exact can you be? Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00836-x","journal-title":"Math Meth Oper Res"},{"key":"874_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-024-00850-7","author":"F B\u00f6kler","year":"2024","unstructured":"B\u00f6kler F, Jasper H (2024) Complexity of the multiobjective minimum weight minimum stretch spanner problem. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-024-00850-7","journal-title":"Math Meth Oper Res"},{"key":"874_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00847-8","author":"F B\u00f6kler","year":"2024","unstructured":"B\u00f6kler F, Parragh SN, Sinnl M, Tricoire F (2024) An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00847-8","journal-title":"Math Meth Oper Res"},{"key":"874_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-024-00856-1","author":"GS Das","year":"2024","unstructured":"Das GS, Gzara F (2024) Column generation based solution for bi-objective gate assignment problems. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-024-00856-1","journal-title":"Math Meth Oper Res"},{"key":"874_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00841-0","author":"K D\u00e4chert","year":"2024","unstructured":"D\u00e4chert K, Fleuren T, Klamroth K (2024) A simple, efficient and versatile objective space algorithm for multiobjective integer programming. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00841-0","journal-title":"Math Meth Oper Res"},{"key":"874_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00826-z","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder G, Gerlach T, Warnow L (2023) A test instance generator for multiobjective mixed-integer optimization. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00826-z","journal-title":"Math Meth Oper Res"},{"key":"874_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00828-x","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder G, Warnow L (2023) A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00828-x","journal-title":"Math Meth Oper Res"},{"key":"874_CR9","doi-asserted-by":"crossref","unstructured":"Fallah S, Ralphs TK, Boland NL (2024) On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem. Math Meth Oper Res,","DOI":"10.1007\/s00186-024-00871-2"},{"key":"874_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00823-2","author":"S Helfrich","year":"2023","unstructured":"Helfrich S, Herzel A, Ruzika S, Thielen C (2023) Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00823-2","journal-title":"Math Meth Oper Res"},{"key":"874_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-024-00870-3","author":"I Lammel","year":"2024","unstructured":"Lammel I, K\u00fcfer KH, S\u00fcss P (2024) An approximation algorithm for multi-objective mixed-integer convex optimization. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-024-00870-3","journal-title":"Math Meth Oper Res"},{"key":"874_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00843-y","author":"D Pecin","year":"2024","unstructured":"Pecin D, Herszterg I, Perini T, Boland N, Savelsbergh M (2024) A fast and robust algorithm for solving biobjective mixed integer programs. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-023-00843-y","journal-title":"Math Meth Oper Res"},{"key":"874_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-024-00849-0","author":"K Teichert","year":"2024","unstructured":"Teichert K, Seidel T, S\u00fcss P (2024) Combining discrete and continuous information for multi-criteria optimization problems. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-024-00849-0","journal-title":"Math Meth Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00874-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-024-00874-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00874-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T09:07:05Z","timestamp":1725268025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-024-00874-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["874"],"URL":"https:\/\/doi.org\/10.1007\/s00186-024-00874-z","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"23 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}