A fast algorithm for assortment optimization problems (Q5945327): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on a Two-dimensional Dynamic Programming Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for the two-dimensional assortment problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A mixed-integer programming model for a class of assortment problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximately global optimization method for assortment problems / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(00)00035-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060615484 / rank | |||
Normal rank |
Latest revision as of 11:14, 30 July 2024
scientific article; zbMATH DE number 1656550
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast algorithm for assortment optimization problems |
scientific article; zbMATH DE number 1656550 |
Statements
A fast algorithm for assortment optimization problems (English)
0 references
3 September 2003
0 references
cutting
0 references
assortment optimization
0 references
linear mixed \(0-1\) programs
0 references