{"id":"https://openalex.org/W1544041853","doi":"https://doi.org/10.1007/978-3-662-46681-0_27","title":"Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions","display_name":"Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1544041853","doi":"https://doi.org/10.1007/978-3-662-46681-0_27","mag":"1544041853"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-46681-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-46681-0_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088301538","display_name":"Roberto Sebastiani","orcid":"https://orcid.org/0000-0002-0989-6101"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"R. Sebastiani","raw_affiliation_strings":["DISI, University of Trento, Trento, Italy"],"affiliations":[{"raw_affiliation_string":"DISI, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024829138","display_name":"Patrick Trentin","orcid":"https://orcid.org/0000-0001-9209-9172"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Trentin","raw_affiliation_strings":["DISI, University of Trento, Trento, Italy"],"affiliations":[{"raw_affiliation_string":"DISI, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088301538"],"corresponding_institution_ids":["https://openalex.org/I193223587"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.8639,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.98093549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"335","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7755169868469238},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7348812818527222},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7075949311256409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6027562022209167},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.5336212515830994},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.5280930399894714},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5164051651954651},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5135793685913086},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4945532977581024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4403073191642761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4334052801132202},{"id":"https://openalex.org/keywords/envelope","display_name":"Envelope (radar)","score":0.43039631843566895},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.430003821849823},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4180341362953186},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41144731640815735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36082637310028076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3537726402282715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26888197660446167},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19171473383903503},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0752142071723938}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7755169868469238},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7348812818527222},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7075949311256409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6027562022209167},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.5336212515830994},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.5280930399894714},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5164051651954651},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5135793685913086},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4945532977581024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4403073191642761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4334052801132202},{"id":"https://openalex.org/C65155139","wikidata":"https://www.wikidata.org/wiki/Q5380912","display_name":"Envelope (radar)","level":3,"score":0.43039631843566895},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.430003821849823},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4180341362953186},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41144731640815735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36082637310028076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3537726402282715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26888197660446167},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19171473383903503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0752142071723938},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-46681-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-46681-0_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:iris.unitn.it:11572/101063","is_oa":false,"landing_page_url":"http://hdl.handle.net/11572/101063","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W54684292","https://openalex.org/W89830494","https://openalex.org/W169672073","https://openalex.org/W221832247","https://openalex.org/W1481397690","https://openalex.org/W1518705996","https://openalex.org/W1548812055","https://openalex.org/W1553068379","https://openalex.org/W1569885273","https://openalex.org/W1571054242","https://openalex.org/W1586677474","https://openalex.org/W1757313772","https://openalex.org/W1824587283","https://openalex.org/W2022846948","https://openalex.org/W2090777457","https://openalex.org/W2094530979","https://openalex.org/W2114037873","https://openalex.org/W2116209568","https://openalex.org/W2125967324","https://openalex.org/W2154984259","https://openalex.org/W2157056800","https://openalex.org/W2188469581","https://openalex.org/W2295061292","https://openalex.org/W2561675875","https://openalex.org/W4285719527","https://openalex.org/W6634978047"],"related_works":["https://openalex.org/W2057820268","https://openalex.org/W1868334863","https://openalex.org/W2950583502","https://openalex.org/W2003690673","https://openalex.org/W1980573502","https://openalex.org/W2209708092","https://openalex.org/W2401269204","https://openalex.org/W2238963713","https://openalex.org/W1505526588","https://openalex.org/W1544041853"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}