{"id":"https://openalex.org/W1588457598","doi":"https://doi.org/10.1007/978-3-642-13036-6_17","title":"A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs","display_name":"A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1588457598","doi":"https://doi.org/10.1007/978-3-642-13036-6_17","mag":"1588457598"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13036-6_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13036-6_17","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":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0911.4055","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058250506","display_name":"Raymond Hemmecke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raymond Hemmecke","raw_affiliation_strings":["Technische Universit\u00e4t Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Munich, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091730054","display_name":"Matthias K\u00f6ppe","orcid":"https://orcid.org/0000-0003-2492-4139"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthias K\u00f6ppe","raw_affiliation_strings":["University of California, Davis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029637448","display_name":"Robert Weismantel","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Robert Weismantel","raw_affiliation_strings":["ETH, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.5316,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.89041376,"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":"219","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.973800003528595,"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/integer","display_name":"Integer (computer science)","score":0.7042241096496582},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6459702849388123},{"id":"https://openalex.org/keywords/integer-points-in-convex-polyhedra","display_name":"Integer points in convex polyhedra","score":0.6275904178619385},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5073193907737732},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4724481701850891},{"id":"https://openalex.org/keywords/radical-of-an-integer","display_name":"Radical of an integer","score":0.4537146985530853},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.43051111698150635},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4231407046318054},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3935120105743408},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26012635231018066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17785561084747314},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.17093005776405334},{"id":"https://openalex.org/keywords/prime-factor","display_name":"Prime factor","score":0.1320425570011139}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7042241096496582},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6459702849388123},{"id":"https://openalex.org/C147700949","wikidata":"https://www.wikidata.org/wiki/Q6042594","display_name":"Integer points in convex polyhedra","level":4,"score":0.6275904178619385},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5073193907737732},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4724481701850891},{"id":"https://openalex.org/C203432157","wikidata":"https://www.wikidata.org/wiki/Q2498974","display_name":"Radical of an integer","level":4,"score":0.4537146985530853},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.43051111698150635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4231407046318054},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3935120105743408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26012635231018066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17785561084747314},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.17093005776405334},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.1320425570011139},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-13036-6_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13036-6_17","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:arXiv.org:0911.4055","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0911.4055","pdf_url":"https://arxiv.org/pdf/0911.4055","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt7pn339wf","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/7pn339wf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:qt7pn339wf","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/7pn339wf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hemmecke, Raymond; K\u00c3\u00b6ppe, Matthias; & Weismantel, Robert. (2009). A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer\\n programs. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/7pn339wf","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0911.4055","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0911.4055","pdf_url":"https://arxiv.org/pdf/0911.4055","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W648165475","https://openalex.org/W1829416734","https://openalex.org/W1963547452","https://openalex.org/W1983610891","https://openalex.org/W1987493955","https://openalex.org/W1988238296","https://openalex.org/W2001104373","https://openalex.org/W2001577580","https://openalex.org/W2016081490","https://openalex.org/W2018562057","https://openalex.org/W2025336071","https://openalex.org/W2033948588","https://openalex.org/W2040101882","https://openalex.org/W2043074138","https://openalex.org/W2043263883","https://openalex.org/W2061272534","https://openalex.org/W2063755475","https://openalex.org/W2065491738","https://openalex.org/W2083860925","https://openalex.org/W2149052950","https://openalex.org/W2482388004","https://openalex.org/W2953170047","https://openalex.org/W4251228745","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W134055995","https://openalex.org/W579069454","https://openalex.org/W2228244008","https://openalex.org/W4200220234","https://openalex.org/W1976332671","https://openalex.org/W1711527768","https://openalex.org/W2769538987","https://openalex.org/W350742197","https://openalex.org/W139245164","https://openalex.org/W2096009084"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}