{"id":"https://openalex.org/W2152452513","doi":"https://doi.org/10.1007/978-3-642-13731-0_18","title":"Capacitated max -Batching with Interval Graph Compatibilities","display_name":"Capacitated max -Batching with Interval Graph Compatibilities","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2152452513","doi":"https://doi.org/10.1007/978-3-642-13731-0_18","mag":"2152452513"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13731-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13731-0_18","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/A5084121765","display_name":"Tim Nonner","orcid":"https://orcid.org/0000-0001-7638-5689"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tim Nonner","raw_affiliation_strings":["Albert Ludwigs University of Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Albert Ludwigs University of Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084121765"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.096,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79255319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9983000159263611,"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/clique","display_name":"Clique","score":0.6933916211128235},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6592048406600952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5693410634994507},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5615407228469849},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5609667897224426},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5198498368263245},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.518269956111908},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5177123546600342},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.485515832901001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44782909750938416},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4141003489494324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41294553875923157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3474525809288025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3454791307449341},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23985689878463745},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17487433552742004},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11180952191352844},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.053125858306884766}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6933916211128235},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6592048406600952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5693410634994507},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5615407228469849},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5609667897224426},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5198498368263245},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.518269956111908},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5177123546600342},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.485515832901001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44782909750938416},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4141003489494324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41294553875923157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3474525809288025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3454791307449341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23985689878463745},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17487433552742004},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11180952191352844},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.053125858306884766},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-13731-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13731-0_18","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:CiteSeerX.psu:10.1.1.313.3817","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.3817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nonner.de/homepage/papers/submodular.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1480448117","https://openalex.org/W1499543701","https://openalex.org/W1542595106","https://openalex.org/W1970095041","https://openalex.org/W1996183272","https://openalex.org/W2011039300","https://openalex.org/W2049181186","https://openalex.org/W2093532287","https://openalex.org/W2100961486","https://openalex.org/W2105821629","https://openalex.org/W2142917378","https://openalex.org/W2154135432","https://openalex.org/W2157164380","https://openalex.org/W2160543991","https://openalex.org/W2165142526","https://openalex.org/W2484473493","https://openalex.org/W4242715512","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2078832298","https://openalex.org/W2794565019","https://openalex.org/W2170790524","https://openalex.org/W2264356384","https://openalex.org/W1561005397","https://openalex.org/W2952246343","https://openalex.org/W1978056388","https://openalex.org/W1992504234","https://openalex.org/W2002128741","https://openalex.org/W3080928114"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}