An exact column-generation approach for the lot-type design problem

DOI10.1007/S11750-020-00582-XzbMATH Open1476.90192arXiv1912.06062OpenAlexW1658694412MaRDI QIDQ1979196FDOQ1979196

Authors: Miriam Kiessling, Sascha Kurz, Jörg Rambau 

Publication date: 2 September 2021

Published in: Top (Search for Journal in Brave)

Abstract: We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances as well as on random instances.

Full work available at URL: https://arxiv.org/abs/1912.06062

Recommendations

• On the lot-type design problem
• An exact algorithm for IP column generation
• Branch-and-price: Column generation for solving huge integer programs
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Column generation for extended formulations

zbMATH Keywords

facility locationcolumn generation\(p\)-medianlot-type design

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Cites Work

• Selected Topics in Column Generation
• Branch-and-price: Column generation for solving huge integer programs
• Introduction to stochastic programming.
• The \(p\)-median problem: a survey of metaheuristic approaches
• Branching in branch-and-price: A generic scheme
• Computational study of large-scale \(p\)-median problems
• A note on branch-and-cut-and-price
• A branch-and-price algorithm for the capacitated facility location problem
• Variable neighborhood search for the p-median
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• New heuristic algorithms for solving the planar \(p\)-median problem
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• A Lagrangian search method for the \(P\)-median problem
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• The integrated size and price optimization problem
• The top-dog index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches
• Title not available (Why is that?)
• A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
• A branch decomposition algorithm for the \(p\)-median problem
• A decomposition approach for the \(p\)-median problem on disconnected graphs
• Branch-and-price-and-cut for a service network design and hub location problem
• Accelerating the branch-and-price algorithm using machine learning
• The approximability of assortment optimization under ranking preferences
• On the lot-type design problem
• Primal Heuristics for Branch and Price: The Assets of Diving Methods

Cited In (1)

• On the lot-type design problem

This page was built for publication: An exact column-generation approach for the lot-type design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979196)