Algorithms for the bin packing problem with scenarios
From MaRDI portal
Publication:6646755
DOI10.1007/s10878-024-01221-yMaRDI QIDQ6646755
Rafael C. S. Schouery, [[Person:6090495|Author name not available (Why is that?)]], Vinícius Loti de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. De Queiroz
Publication date: 3 December 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
approximation algorithmvariable neighborhood searchbin packing problemscenariosbranch-and-price algorithm
Cites Work
- There is no asymptotic PTAS for two-dimensional vector packing
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- Procedures for the bin packing problem with precedence constraints
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Lower and upper bounds for the bin packing problem with fragile objects
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A survey of dual-feasible and superadditive functions
- Stabilized branch-and-price algorithms for vector packing problems
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Bin packing can be solved within 1+epsilon in linear time
- Solving binary cutting stock problems by column generation and branch- and-bound
- Variable neighborhood search
- The optimal absolute ratio for online bin packing
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels
- Robust supply chain network design with service level against disruptions and demand uncertainties: a real-life case
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- The bin packing problem with item fragmentation: a worst-case analysis
- Bin packing problem with scenarios
- An improved typology of cutting and packing problems
- Exact solution of network flow models with strong relaxations
- A suggested computation for maximal multi-commodity network flows
- Scheduling over Scenarios on Two Machines
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A simple on-line bin-packing algorithm
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- `` Strong NP-Completeness Results
- On Multidimensional Packing Problems
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Tight bounds for online vector bin packing
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing
- There is no APTAS for 2-dimensional vector bin packing: revisited
This page was built for publication: Algorithms for the bin packing problem with scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646755)
