Algorithms for the bin packing problem with scenarios
- 24 October 2024
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (4) , 1-28
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (144257/2019-0, 312271/2023-9, 315555/2023-8, 312345/2023-2)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (408722/2023-1, 313146/2022-5)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2017/11831-1, 405369/2021-2, 404315/2023-2)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2022/05803-3, 2022/05803-3, 2022/05803-3)
This publication has 51 references indexed in Scilit:
- Exact solution of network flow models with strong relaxationsMathematical Programming, 2022
- Bin packing problem with scenariosCentral European Journal of Operations Research, 2018
- Scheduling over Scenarios on Two Machines2014
- Bin Packing Approximation Algorithms: Survey and Classification2013
- A survey of dual-feasible and superadditive functionsAnnals of Operations Research, 2008
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraintAnnals of Operations Research, 2008
- Bringing order into the neighborhoods: relaxation guided variable neighborhood searchJournal of Heuristics, 2007
- New classes of fast lower bounds for bin packing problemsMathematical Programming, 2001
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981