{"id":"https://openalex.org/W2060879564","doi":"https://doi.org/10.1016/0166-218x(87)90015-1","title":"Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms","display_name":"Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms","publication_year":1987,"publication_date":"1987-11-01","ids":{"openalex":"https://openalex.org/W2060879564","doi":"https://doi.org/10.1016/0166-218x(87)90015-1","mag":"2060879564"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(87)90015-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(87)90015-1","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/A5000303642","display_name":"Ruy Eduardo Campello","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ruy Eduardo Campello","raw_affiliation_strings":["FURNAS \u2013 Centrais El\u00e9tricas S.A., Rua Real Grandeza, 219, 22283 Rio de Janeiro, Brazil"],"affiliations":[{"raw_affiliation_string":"FURNAS \u2013 Centrais El\u00e9tricas S.A., Rua Real Grandeza, 219, 22283 Rio de Janeiro, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091887230","display_name":"Nelson Maculan","orcid":"https://orcid.org/0000-0002-3897-3356"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Nelson F. Maculan","raw_affiliation_strings":["COPPE and Instituto de Matem\u00e1tica, Federal University of Rio de Janeiro, P.O. Box 68511, 21945 Rio de Janeiro, Brazil"],"affiliations":[{"raw_affiliation_string":"COPPE and Instituto de Matem\u00e1tica, Federal University of Rio de Janeiro, P.O. Box 68511, 21945 Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000303642"],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.5752,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.658867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"2","first_page":"119","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9915000200271606,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9876999855041504,"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.8944294452667236},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7405027151107788},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7386674284934998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7224132418632507},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6337012052536011},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6184006333351135},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.613667368888855},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6033109426498413},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5534732341766357},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5473790168762207},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5235033631324768},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4747629165649414},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4538674056529999},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4412565529346466},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.42423659563064575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4106614291667938},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26371991634368896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.217962384223938}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8944294452667236},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7405027151107788},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7386674284934998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7224132418632507},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6337012052536011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6184006333351135},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.613667368888855},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6033109426498413},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5534732341766357},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5473790168762207},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5235033631324768},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4747629165649414},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4538674056529999},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4412565529346466},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.42423659563064575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4106614291667938},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26371991634368896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.217962384223938},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/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.1016/0166-218x(87)90015-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(87)90015-1","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1481747975","https://openalex.org/W1603398055","https://openalex.org/W1979018429","https://openalex.org/W1997231674","https://openalex.org/W2001341021","https://openalex.org/W2012682597","https://openalex.org/W2017697298","https://openalex.org/W2109001700","https://openalex.org/W2139211712","https://openalex.org/W2262767094","https://openalex.org/W4236384091","https://openalex.org/W4242130683"],"related_works":["https://openalex.org/W3125911973","https://openalex.org/W58208513","https://openalex.org/W3125779997","https://openalex.org/W2045837509","https://openalex.org/W1482136263","https://openalex.org/W1942724698","https://openalex.org/W1966891017","https://openalex.org/W2037211437","https://openalex.org/W1971625902","https://openalex.org/W2060879564"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}
