{"id":"https://openalex.org/W1983479437","doi":"https://doi.org/10.1016/s0166-218x(01)00252-9","title":"On some difficult linear programs coming from set partitioning","display_name":"On some difficult linear programs coming from set partitioning","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W1983479437","doi":"https://doi.org/10.1016/s0166-218x(01)00252-9","mag":"1983479437"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(01)00252-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00252-9","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","IBM Thomas J. Watson Research Center - P.O. Box 218 Yorktown Heights, NY 10598, USA"],"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center - P.O. Box 218 Yorktown Heights, NY 10598, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055838155","display_name":"Ranga Anbil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ranga Anbil","raw_affiliation_strings":["Caleb Technologies Corp. 9130 Jollyville Road, Suite 100, Austin, TX 78759, USA","Caleb Technologies Corp. 9130 Jollyville Road, Suite 100, Austin, TX 78759, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Caleb Technologies Corp. 9130 Jollyville Road, Suite 100, Austin, TX 78759, USA","institution_ids":[]},{"raw_affiliation_string":"Caleb Technologies Corp. 9130 Jollyville Road, Suite 100, Austin, TX 78759, USA#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076877502"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":4.9354,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.9400321,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"118","issue":"1-2","first_page":"3","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9966999888420105,"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.9966999888420105,"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.9941999912261963,"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.9940000176429749,"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/subgradient-method","display_name":"Subgradient method","score":0.8021988272666931},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7324167490005493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5939083099365234},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5717037916183472},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5506085157394409},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5364236831665039},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5331646203994751},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.5010948181152344},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4654560685157776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46205320954322815},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4485255777835846},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4255210757255554},{"id":"https://openalex.org/keywords/linear-extension","display_name":"Linear extension","score":0.4143028259277344},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41083937883377075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3831924498081207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3712494969367981},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13070106506347656}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8021988272666931},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7324167490005493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5939083099365234},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5717037916183472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5506085157394409},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5364236831665039},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5331646203994751},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.5010948181152344},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4654560685157776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46205320954322815},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4485255777835846},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4255210757255554},{"id":"https://openalex.org/C129393996","wikidata":"https://www.wikidata.org/wiki/Q6553442","display_name":"Linear extension","level":3,"score":0.4143028259277344},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41083937883377075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3831924498081207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3712494969367981},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13070106506347656},{"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},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(01)00252-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00252-9","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W224775207","https://openalex.org/W941495419","https://openalex.org/W1573881838","https://openalex.org/W1579927935","https://openalex.org/W1967337017","https://openalex.org/W1974645784","https://openalex.org/W1992311033","https://openalex.org/W2008164266","https://openalex.org/W2008571296","https://openalex.org/W2009803313","https://openalex.org/W2015263936","https://openalex.org/W2017697298","https://openalex.org/W2047092360","https://openalex.org/W2050014122","https://openalex.org/W2058748455","https://openalex.org/W2061597864","https://openalex.org/W2064986600","https://openalex.org/W2091604953","https://openalex.org/W2091836882","https://openalex.org/W2092245320","https://openalex.org/W2099813847","https://openalex.org/W2130469840","https://openalex.org/W2143418989","https://openalex.org/W2158446314","https://openalex.org/W2482602379","https://openalex.org/W2911911537","https://openalex.org/W4211092921","https://openalex.org/W4242576043","https://openalex.org/W6673655451"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W1531708257","https://openalex.org/W2593343445","https://openalex.org/W2171830873","https://openalex.org/W2979654979","https://openalex.org/W2769220156","https://openalex.org/W2903252607","https://openalex.org/W134055995","https://openalex.org/W2358341242"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}