{"id":"https://openalex.org/W2055782437","doi":"https://doi.org/10.1016/s0305-0548(96)00015-9","title":"A binary integer linear program with multi-criteria and multi-constraint levels","display_name":"A binary integer linear program with multi-criteria and multi-constraint levels","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2055782437","doi":"https://doi.org/10.1016/s0305-0548(96)00015-9","mag":"2055782437"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(96)00015-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(96)00015-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","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/A5113542097","display_name":"Yong Shi","orcid":"https://orcid.org/0000-0001-7974-1079"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yong Shi","raw_affiliation_strings":["Department of Information Systems and Quantitative Analysis, College of Information Science and Technology, University of Nebraska at Omaha, Omaha, NE 68182, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems and Quantitative Analysis, College of Information Science and Technology, University of Nebraska at Omaha, Omaha, NE 68182, U.S.A","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113818210","display_name":"Heeseok Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Heeseok Lee","raw_affiliation_strings":["Department of Management Information Systems, Korea Advanced Institute of Science and Technology, Seoul, 207-43, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Information Systems, Korea Advanced Institute of Science and Technology, Seoul, 207-43, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113542097"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.435,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.81848796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"3","first_page":"259","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9957000017166138,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.8335561752319336},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7660749554634094},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7410473227500916},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.7149911522865295},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.7114295363426208},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6778393983840942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.648827314376831},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6230051517486572},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6020951867103577},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5942142009735107},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5914760231971741},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5395118594169617},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5383781790733337},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.5187766551971436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2716885209083557}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.8335561752319336},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7660749554634094},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7410473227500916},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7149911522865295},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.7114295363426208},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6778393983840942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.648827314376831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6230051517486572},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6020951867103577},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5942142009735107},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5914760231971741},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5395118594169617},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5383781790733337},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.5187766551971436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2716885209083557},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(96)00015-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(96)00015-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311308","display_name":"University of Nebraska Omaha","ror":"https://ror.org/04yrkc140"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W297488365","https://openalex.org/W1487048116","https://openalex.org/W1503327452","https://openalex.org/W1509479425","https://openalex.org/W1551635709","https://openalex.org/W1608339372","https://openalex.org/W1963910993","https://openalex.org/W1968143987","https://openalex.org/W1972695578","https://openalex.org/W1979689356","https://openalex.org/W1985207547","https://openalex.org/W1986808060","https://openalex.org/W1998974905","https://openalex.org/W1999486572","https://openalex.org/W2002772288","https://openalex.org/W2028403947","https://openalex.org/W2028498002","https://openalex.org/W2030358626","https://openalex.org/W2033735555","https://openalex.org/W2036737894","https://openalex.org/W2041653850","https://openalex.org/W2043482243","https://openalex.org/W2056333950","https://openalex.org/W2058405009","https://openalex.org/W2065086360","https://openalex.org/W2066691774","https://openalex.org/W2077133726","https://openalex.org/W2078702481","https://openalex.org/W2080248850","https://openalex.org/W2091364465","https://openalex.org/W2100890245","https://openalex.org/W2103054960","https://openalex.org/W2103263531","https://openalex.org/W2127339046","https://openalex.org/W2127470768","https://openalex.org/W2140827645","https://openalex.org/W2144931885","https://openalex.org/W2158550687","https://openalex.org/W2167539320","https://openalex.org/W2169666402","https://openalex.org/W2244525737","https://openalex.org/W2336259629","https://openalex.org/W2595833503","https://openalex.org/W2607019272","https://openalex.org/W2796604629","https://openalex.org/W3109119980","https://openalex.org/W4240374930","https://openalex.org/W4253845860","https://openalex.org/W6666383728"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2024753861","https://openalex.org/W2568448495","https://openalex.org/W2081493497","https://openalex.org/W2218893665","https://openalex.org/W2058772914","https://openalex.org/W2134668949","https://openalex.org/W2084009144","https://openalex.org/W4210268737","https://openalex.org/W192166791"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}