{"id":"https://openalex.org/W1549174816","doi":"https://doi.org/10.1007/s10107-003-0400-z","title":"On the facets of the mixed?integer knapsack polyhedron","display_name":"On the facets of the mixed?integer knapsack polyhedron","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W1549174816","doi":"https://doi.org/10.1007/s10107-003-0400-z","mag":"1549174816"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0400-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0400-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","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/A5096888819","display_name":"Alper Atamt\ufffdrk","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alper Atamt\ufffdrk","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA, 94720\u20131777","University of California at Berkeley"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA, 94720\u20131777","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5096888819"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":9.285,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.97537016,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"98","issue":"1-3","first_page":"145","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9797000288963318,"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/polyhedron","display_name":"Polyhedron","score":0.900499701499939},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8407194018363953},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.823135495185852},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7349618673324585},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.7293294668197632},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6866970062255859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6315947771072388},{"id":"https://openalex.org/keywords/integer-points-in-convex-polyhedra","display_name":"Integer points in convex polyhedra","score":0.628313422203064},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5909271836280823},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5032801032066345},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4724082350730896},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4639747738838196},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.46382394433021545},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36263585090637207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2540504038333893},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.22298702597618103},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.21068590879440308},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13164028525352478},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.10766875743865967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0803450345993042}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.900499701499939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8407194018363953},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.823135495185852},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7349618673324585},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.7293294668197632},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6866970062255859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6315947771072388},{"id":"https://openalex.org/C147700949","wikidata":"https://www.wikidata.org/wiki/Q6042594","display_name":"Integer points in convex polyhedra","level":4,"score":0.628313422203064},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5909271836280823},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5032801032066345},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4724082350730896},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4639747738838196},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.46382394433021545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36263585090637207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2540504038333893},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.22298702597618103},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.21068590879440308},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13164028525352478},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.10766875743865967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0803450345993042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0400-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0400-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W65792763","https://openalex.org/W180443138","https://openalex.org/W1481126596","https://openalex.org/W1721531133","https://openalex.org/W1922855725","https://openalex.org/W1968143987","https://openalex.org/W1985862636","https://openalex.org/W1985990685","https://openalex.org/W1990585107","https://openalex.org/W1991247020","https://openalex.org/W1993734840","https://openalex.org/W2007126271","https://openalex.org/W2009082978","https://openalex.org/W2021043398","https://openalex.org/W2022398556","https://openalex.org/W2041989601","https://openalex.org/W2046076510","https://openalex.org/W2046300504","https://openalex.org/W2055287160","https://openalex.org/W2064366623","https://openalex.org/W2070045881","https://openalex.org/W2087132085","https://openalex.org/W2103254960","https://openalex.org/W2114587443","https://openalex.org/W2124452917","https://openalex.org/W2132324770","https://openalex.org/W2137021253","https://openalex.org/W2158515702","https://openalex.org/W2160294322","https://openalex.org/W2163013568","https://openalex.org/W2167539320","https://openalex.org/W2173347621","https://openalex.org/W2268446974","https://openalex.org/W2336259629","https://openalex.org/W3124498598"],"related_works":["https://openalex.org/W2800262604","https://openalex.org/W134055995","https://openalex.org/W4248823117","https://openalex.org/W3005326639","https://openalex.org/W2115718900","https://openalex.org/W2138452122","https://openalex.org/W2168332770","https://openalex.org/W1549174816","https://openalex.org/W137285713","https://openalex.org/W2964003753"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}