scientific article; zbMATH DE number 1310285

DOI<239::AID-NET10>3.0.CO;2-G 10.1002/(SICI)1097-0037(199905)33:3<239::AID-NET10>3.0.CO;2-GzbMath0953.90003MaRDI QIDQ4254361

Haldun Süral, Yigal Gerchak, Ashish Tripathy

Publication date: 29 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristic proceduredesign and inventory problemdiscrete multidimensional assortment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (4)

A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Branch and peg algorithms for the simple plant location problem. ⋮ Branch and peg algorithms for the simple plant location problem ⋮ Equivalent instances of the simple plant location problem

Cites Work

• A Few Remarks on the Assortment Problem
• Technical Note—On the Optimal Choice of Sizes
• The Discrete Two-Dimensional Assortment Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Note on a Two-dimensional Dynamic Programming Problem
• The Assortment Problem with Probabilistic Demands
• The Assortment Problem with Nonlinear Cost Functions
• The Plant Location Problem: New Models and Research Prospects
• Specially Structured Uncapacitated Facility Location Problems
• Minimum Concave Cost Flows in Certain Networks

This page was built for publication: