An approximately global optimization method for assortment problems

European Journal of Operational Research

Volumn 105, Issue 3, 1998, Pages 604-612

  Li, Han Lin ^a   Chang, Ching Ter ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Assortment; Optimization

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

ASSORTMENT PROBLEMS; GLOBAL OPTIMAL SOLUTION; NON OVERLAPPING CONSTRAINTS;

OPTIMIZATION;

EID: 0032027757     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00072-6     Document Type: Article

References (5)

1. C.S. Chen, S. Sarin, R. Balasubramanian, A mixed-integer programming model for a class of assortment problems, European Journal of Operational Research 63 (1993) 362-367.
2. J.E. Beasley, An algorithm for the two-dimensional assortment problem, European Journal of Operational Research 19 (1985) 253-261.
3. A.I. Hinxman, The trim-loss and Assortment problem: A survey, European Journal of Operational Research 5 (1980) 8-18.
4. S. Linus, LINDO release 5.3, LINDO System, Inc., 1994.
5. E. Page, A note on a two-dimensional dynamic problem, Operational Research Quarterly 26 (1975) 321-324.