{"id":"https://openalex.org/W2164056371","doi":"https://doi.org/10.1016/s0167-6377(02)00122-0","title":"The quadratic 0\u20131 knapsack problem with series\u2013parallel support","display_name":"The quadratic 0\u20131 knapsack problem with series\u2013parallel support","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2164056371","doi":"https://doi.org/10.1016/s0167-6377(02)00122-0","mag":"2164056371"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(02)00122-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00122-0","pdf_url":"https://doi.org/science/article/pii/S0167637702001220","source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/science/article/pii/S0167637702001220","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109839162","display_name":"David J. Rader","orcid":null},"institutions":[{"id":"https://openalex.org/I192578771","display_name":"Rose\u2013Hulman Institute of Technology","ror":"https://ror.org/00mp6e841","country_code":"US","type":"education","lineage":["https://openalex.org/I192578771"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David J. Rader Jr.","raw_affiliation_strings":["Department of Mathematics, Rose-Hulman Institute of Technology, Terre Haute, IN 47803, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Rose-Hulman Institute of Technology, Terre Haute, IN 47803, USA","institution_ids":["https://openalex.org/I192578771"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Faculty of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109839162"],"corresponding_institution_ids":["https://openalex.org/I192578771"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":0.9345,"has_fulltext":true,"cited_by_count":49,"citation_normalized_percentile":{"value":0.82312857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"3","first_page":"159","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9833999872207642,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8106673955917358},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6630815863609314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6413254141807556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6330835819244385},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5632723569869995},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5448692440986633},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4931175410747528},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.42400574684143066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.418655127286911},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.41679131984710693},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4163975119590759},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4118099510669708},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3584381639957428},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23505061864852905}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8106673955917358},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6630815863609314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6413254141807556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6330835819244385},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5632723569869995},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5448692440986633},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4931175410747528},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.42400574684143066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.418655127286911},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.41679131984710693},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4163975119590759},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4118099510669708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3584381639957428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23505061864852905},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1016/s0167-6377(02)00122-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00122-0","pdf_url":"https://doi.org/science/article/pii/S0167637702001220","source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/8f9cb5a4-7e51-4173-a7e1-6b782d412e15","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/8f9cb5a4-7e51-4173-a7e1-6b782d412e15","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rader, D J & Woeginger, G J 2002, 'The quadratic 0-1 knapsack problem with series-parallel support', Operations Research Letters, vol. 30, no. 3, pp. 159-166. https://doi.org/10.1016/S0167-6377(02)00122-0","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/04e6318f-0898-4ba7-805e-b84aa7210989","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/04e6318f-0898-4ba7-805e-b84aa7210989","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rader Jr, D J & Woeginger, G 2002, 'The quadratic 0-1 knapsack problem with series-parallel support', Operations research letters, vol. 30, no. 3, pp. 159-166. https://doi.org/10.1016/S0167-6377(02)00122-0","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:623761","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623761","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6377","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:623761","is_oa":false,"landing_page_url":"http://repository.tue.nl/623761","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6377","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:ris.utwente.nl:publications/04e6318f-0898-4ba7-805e-b84aa7210989","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/8f9cb5a4-7e51-4173-a7e1-6b782d412e15","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/8f9cb5a4-7e51-4173-a7e1-6b782d412e15","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Operations Research Letters, 30(3), 159 - 166. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/s0167-6377(02)00122-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00122-0","pdf_url":"https://doi.org/science/article/pii/S0167637702001220","source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2164056371.pdf","grobid_xml":"https://content.openalex.org/works/W2164056371.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W176142888","https://openalex.org/W1509288136","https://openalex.org/W1563298345","https://openalex.org/W1669378206","https://openalex.org/W1970801029","https://openalex.org/W1985495277","https://openalex.org/W1994007819","https://openalex.org/W2003021478","https://openalex.org/W2011039300","https://openalex.org/W2026891055","https://openalex.org/W2026973340","https://openalex.org/W2029859833","https://openalex.org/W2057884923","https://openalex.org/W2073840571","https://openalex.org/W2113195911","https://openalex.org/W2137023518","https://openalex.org/W2250294758","https://openalex.org/W2401096565","https://openalex.org/W4285719527","https://openalex.org/W6691407370"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3166857172","https://openalex.org/W3169691842","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1556368910","https://openalex.org/W1966986652"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}