{"id":"https://openalex.org/W1580818183","doi":"https://doi.org/10.1007/11764298_4","title":"An Incremental Model for Combinatorial Maximization Problems","display_name":"An Incremental Model for Combinatorial Maximization Problems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1580818183","doi":"https://doi.org/10.1007/11764298_4","mag":"1580818183"},"language":"en","primary_location":{"id":"doi:10.1007/11764298_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11764298_4","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/A5061761478","display_name":"Jeff Hartline","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeff Hartline","raw_affiliation_strings":["Cornell University, Ithaca, USA","Cornell University (Ithaca, NY);"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026487605","display_name":"Alexa Sharp","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexa Sharp","raw_affiliation_strings":["Cornell University, Ithaca, USA","Cornell University (Ithaca, NY);"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061761478"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8318,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.72826516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9926000237464905,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8043949604034424},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.735296905040741},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6508093476295471},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6262627840042114},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5341578722000122},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5327323079109192},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5086244344711304},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4980034828186035},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4766422212123871},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47582367062568665},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4548110067844391},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4150565266609192},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3608255088329315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3520527482032776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22882914543151855},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1141757071018219}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8043949604034424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.735296905040741},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6508093476295471},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6262627840042114},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5341578722000122},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5327323079109192},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5086244344711304},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4980034828186035},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4766422212123871},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47582367062568665},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4548110067844391},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4150565266609192},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3608255088329315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3520527482032776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22882914543151855},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1141757071018219},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11764298_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11764298_4","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":29,"referenced_works":["https://openalex.org/W1512794094","https://openalex.org/W1531368347","https://openalex.org/W1552828154","https://openalex.org/W1578508051","https://openalex.org/W1580818183","https://openalex.org/W1781772683","https://openalex.org/W1973264045","https://openalex.org/W1975216035","https://openalex.org/W1981673685","https://openalex.org/W1985942708","https://openalex.org/W2002285507","https://openalex.org/W2026891055","https://openalex.org/W2034372438","https://openalex.org/W2104103056","https://openalex.org/W2113195911","https://openalex.org/W2122381782","https://openalex.org/W2134422938","https://openalex.org/W2144963887","https://openalex.org/W2162656786","https://openalex.org/W2165956524","https://openalex.org/W2166858292","https://openalex.org/W2222512263","https://openalex.org/W2401610261","https://openalex.org/W2769245605","https://openalex.org/W4231298550","https://openalex.org/W4235797326","https://openalex.org/W4247388812","https://openalex.org/W4248275387","https://openalex.org/W6884737555"],"related_works":["https://openalex.org/W2968037521","https://openalex.org/W2357469710","https://openalex.org/W2461841679","https://openalex.org/W2596165142","https://openalex.org/W69176915","https://openalex.org/W2118779360","https://openalex.org/W196138040","https://openalex.org/W2461366636","https://openalex.org/W2473132644","https://openalex.org/W4246202890"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}