{"id":"https://openalex.org/W4415979965","doi":"https://doi.org/10.1016/j.ejor.2025.11.004","title":"Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches","display_name":"Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches","publication_year":2025,"publication_date":"2025-11-07","ids":{"openalex":"https://openalex.org/W4415979965","doi":"https://doi.org/10.1016/j.ejor.2025.11.004"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2025.11.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ejor.2025.11.004","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"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":"European Journal of Operational 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/A5014435293","display_name":"Hoang Giang Pham","orcid":"https://orcid.org/0000-0001-8356-3180"},"institutions":[{"id":"https://openalex.org/I79891267","display_name":"Singapore Management University","ror":"https://ror.org/050qmg959","country_code":"SG","type":"education","lineage":["https://openalex.org/I79891267"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Hoang Giang Pham","raw_affiliation_strings":["School of Computing and Information Systems, Singapore Management University, 80 Stamford Rd, 178902, Singapore"],"raw_orcid":"https://orcid.org/0000-0001-8356-3180","affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, Singapore Management University, 80 Stamford Rd, 178902, Singapore","institution_ids":["https://openalex.org/I79891267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074307998","display_name":"Tien Mai","orcid":"https://orcid.org/0000-0003-3263-5003"},"institutions":[{"id":"https://openalex.org/I79891267","display_name":"Singapore Management University","ror":"https://ror.org/050qmg959","country_code":"SG","type":"education","lineage":["https://openalex.org/I79891267"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Tien Mai","raw_affiliation_strings":["School of Computing and Information Systems, Singapore Management University, 80 Stamford Rd, 178902, Singapore"],"raw_orcid":"https://orcid.org/0000-0003-3263-5003","affiliations":[{"raw_affiliation_string":"School of Computing and Information Systems, Singapore Management University, 80 Stamford Rd, 178902, Singapore","institution_ids":["https://openalex.org/I79891267"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014435293"],"corresponding_institution_ids":["https://openalex.org/I79891267"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.47331216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"332","issue":"1","first_page":"257","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.8827000260353088,"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"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.8827000260353088,"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.041999999433755875,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5752000212669373},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5054000020027161},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4375999867916107},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.39800000190734863},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3962000012397766},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.3752000033855438},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.3702999949455261},{"id":"https://openalex.org/keywords/purchasing","display_name":"Purchasing","score":0.36570000648498535}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7206000089645386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6467999815940857},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5752000212669373},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5054000020027161},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.39800000190734863},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2770000100135803},{"id":"https://openalex.org/C2781386248","wikidata":"https://www.wikidata.org/wiki/Q11898700","display_name":"Revenue management","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26649999618530273}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ejor.2025.11.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ejor.2025.11.004","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"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":"European Journal of Operational Research","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":47,"referenced_works":["https://openalex.org/W88459763","https://openalex.org/W1680189815","https://openalex.org/W1977062375","https://openalex.org/W1980457222","https://openalex.org/W2033885045","https://openalex.org/W2034504820","https://openalex.org/W2047422707","https://openalex.org/W2067581912","https://openalex.org/W2071334094","https://openalex.org/W2077810459","https://openalex.org/W2095705345","https://openalex.org/W2102037914","https://openalex.org/W2105562458","https://openalex.org/W2106844645","https://openalex.org/W2117923605","https://openalex.org/W2120840732","https://openalex.org/W2125649381","https://openalex.org/W2132651631","https://openalex.org/W2137344397","https://openalex.org/W2143996311","https://openalex.org/W2144425834","https://openalex.org/W2148648976","https://openalex.org/W2158777411","https://openalex.org/W2160317938","https://openalex.org/W2167598103","https://openalex.org/W2168628822","https://openalex.org/W2169725625","https://openalex.org/W2174936192","https://openalex.org/W2420698967","https://openalex.org/W2620325536","https://openalex.org/W2759930078","https://openalex.org/W2900814849","https://openalex.org/W2964358627","https://openalex.org/W2968888627","https://openalex.org/W2971646149","https://openalex.org/W2975579666","https://openalex.org/W2999769590","https://openalex.org/W3011311334","https://openalex.org/W3084666641","https://openalex.org/W3091802468","https://openalex.org/W3121891820","https://openalex.org/W3199535320","https://openalex.org/W3207043624","https://openalex.org/W4210457748","https://openalex.org/W4366166364","https://openalex.org/W4381952916","https://openalex.org/W4399492285"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-11-07T00:00:00"}