Approximately global optimization for assortment problems using piecewise linearization techniques
From MaRDI portal
Publication:1848593
DOI10.1016/S0377-2217(01)00194-1zbMath0998.90067OpenAlexW2057429120MaRDI QIDQ1848593
Ching-Ter Chang, Jung-Fa Tsai, Han-Lin Li
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00194-1
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Operations research and management science (90B99)
Related Items
Constrained abductive reasoning with fuzzy parameters in Bayesian networks ⋮ MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS ⋮ An optimization approach for supply chain management models with quantity discount policy ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ A review of deterministic optimization methods in engineering and management ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ Stochastic programming for vendor portfolio selection and order allocation under delivery uncertainty ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ An approximation algorithm for a competitive facility location problem with network effects ⋮ Reformulation of the modified goal programming for logarithmic piecewise linear function ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ An efficient deterministic optimization approach for rectangular packing problems
Uses Software
Cites Work
