{"id":"https://openalex.org/W9453616","doi":"https://doi.org/10.1007/978-94-009-1606-7_11","title":"An Integer Linear Programming Algorithm Polynomial in the Average Case","display_name":"An Integer Linear Programming Algorithm Polynomial in the Average Case","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W9453616","doi":"https://doi.org/10.1007/978-94-009-1606-7_11","mag":"9453616"},"language":"en","primary_location":{"id":"doi:10.1007/978-94-009-1606-7_11","doi":"https://doi.org/10.1007/978-94-009-1606-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-94-009-1606-7_11","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Analysis and Operations Research","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4301667650","display_name":"Discrete Analysis and Operations Research"},"type":"book-chapter","is_traditional":true,"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/A5113731741","display_name":"Nikolai Nikolaevich Kuzyurin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"N. N. Kuzyurin","raw_affiliation_strings":["Institute of System Sciences, B. Kommunisticheskaya, 25, Moscow, 109004, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of System Sciences, B. Kommunisticheskaya, 25, Moscow, 109004, Russia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5113731741"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1483,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75108413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9390000104904175,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9390000104904175,"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/T12176","display_name":"Optimization and Packing Problems","score":0.0560000017285347,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.8299999833106995},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"average-case complexity","score":0.7419999837875366},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.7770000100135803},{"id":"https://openalex.org/keywords/multidimensional-knapsack-problem","display_name":"multidimensional knapsack problem","score":0.9819999933242798},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8230000138282776},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7250000238418579},{"id":"https://openalex.org/keywords/performance-ratio","display_name":"performance ratio","score":0.6209999918937683},{"id":"https://openalex.org/keywords/p-versus-np","display_name":"P versus NP","score":0.7160000205039978}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7888146042823792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6030459403991699},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5623776316642761},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5517945289611816},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5223216414451599},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5099722146987915},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5024847984313965},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4926498532295227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46990105509757996},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4513973593711853},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4500402510166168},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.42624741792678833},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4151051640510559},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.3176637291908264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3105291724205017},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.2544865310192108},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-94-009-1606-7_11","doi":"https://doi.org/10.1007/978-94-009-1606-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-94-009-1606-7_11","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Analysis and Operations Research","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W158695264","https://openalex.org/W562911038","https://openalex.org/W1571051474","https://openalex.org/W1655990431","https://openalex.org/W1963547452","https://openalex.org/W2002273082","https://openalex.org/W2012473793","https://openalex.org/W2030689634","https://openalex.org/W2050917944","https://openalex.org/W2053651631","https://openalex.org/W2055978814","https://openalex.org/W2059453880","https://openalex.org/W2061496873","https://openalex.org/W2062731608","https://openalex.org/W2093321189","https://openalex.org/W2095007759","https://openalex.org/W2100008268","https://openalex.org/W2107993699","https://openalex.org/W2113195911","https://openalex.org/W2143391442","https://openalex.org/W4301808069","https://openalex.org/W6629781928"],"related_works":["https://openalex.org/W2084038215","https://openalex.org/W7100754474","https://openalex.org/W4250282287","https://openalex.org/W1983460042","https://openalex.org/W2067500652","https://openalex.org/W1581152859","https://openalex.org/W2502395580","https://openalex.org/W2305357766","https://openalex.org/W2513390201","https://openalex.org/W2539839596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2016-06-24T00:00:00"}