{"id":"https://openalex.org/W3006222091","doi":"https://doi.org/10.1007/978-3-030-58942-4_34","title":"Conflict-Free Learning for Mixed Integer Programming","display_name":"Conflict-Free Learning for Mixed Integer Programming","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3006222091","doi":"https://doi.org/10.1007/978-3-030-58942-4_34","mag":"3006222091"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-58942-4_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58942-4_34","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/A5023964148","display_name":"Jakob Witzig","orcid":"https://orcid.org/0000-0003-2698-0767"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jakob Witzig","raw_affiliation_strings":["Zuse Institute Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Zuse Institute Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086697282","display_name":"Timo Berthold","orcid":"https://orcid.org/0000-0002-6320-8154"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Timo Berthold","raw_affiliation_strings":["Fair Isaac Germany GmbH, Bensheim, Germany"],"affiliations":[{"raw_affiliation_string":"Fair Isaac Germany GmbH, Bensheim, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023964148"],"corresponding_institution_ids":["https://openalex.org/I195893171"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.04269029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"521","last_page":"530"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9943000078201294,"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":0.9943000078201294,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9735000133514404,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7251476645469666},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7122750282287598},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6454333662986755},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6062710285186768},{"id":"https://openalex.org/keywords/remainder","display_name":"Remainder","score":0.5788092613220215},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5612655282020569},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5480130910873413},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5429655313491821},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5026283264160156},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4989006519317627},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.47626325488090515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23473283648490906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17747342586517334},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07712990045547485}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7251476645469666},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7122750282287598},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6454333662986755},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6062710285186768},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.5788092613220215},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5612655282020569},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5480130910873413},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5429655313491821},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5026283264160156},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4989006519317627},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.47626325488090515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23473283648490906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17747342586517334},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07712990045547485},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-58942-4_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58942-4_34","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W51621564","https://openalex.org/W1594623453","https://openalex.org/W1766618864","https://openalex.org/W1974709582","https://openalex.org/W1990267895","https://openalex.org/W2033735555","https://openalex.org/W2038118137","https://openalex.org/W2043829066","https://openalex.org/W2044560939","https://openalex.org/W2064842543","https://openalex.org/W2067627899","https://openalex.org/W2176812374","https://openalex.org/W2189345514","https://openalex.org/W2555363809","https://openalex.org/W2587095554","https://openalex.org/W2911910091","https://openalex.org/W2913258176","https://openalex.org/W3085454911","https://openalex.org/W3106195685","https://openalex.org/W4240374930","https://openalex.org/W4300568640","https://openalex.org/W6759781625","https://openalex.org/W6759932240"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W4244487479","https://openalex.org/W1963627056","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}