Algorithms for the bin packing problem with scenarios
From MaRDI portal
Recommendations
Cites work
- `` Strong NP-Completeness Results
- A branch-and-price algorithm for the temporal bin packing problem
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A generalized bin packing problem for parcel delivery in last-mile logistics
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A simple on-line bin-packing algorithm
- A suggested computation for maximal multi-commodity network flows
- A survey of dual-feasible and superadditive functions
- An improved typology of cutting and packing problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing problem with scenarios
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Exact solution of network flow models with strong relaxations
- Lower and upper bounds for the bin packing problem with fragile objects
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing
- On Multidimensional Packing Problems
- Procedures for the bin packing problem with precedence constraints
- Robust supply chain network design with service level against disruptions and demand uncertainties: a real-life case
- Scheduling over scenarios on two machines
- Solving binary cutting stock problems by column generation and branch- and-bound
- Stabilized branch-and-price algorithms for vector packing problems
- The bin packing problem with item fragmentation: a worst-case analysis
- The Decomposition Algorithm for Linear Programs
- The optimal absolute ratio for online bin packing
- There is no APTAS for 2-dimensional vector bin packing: revisited
- There is no asymptotic PTAS for two-dimensional vector packing
- Tight bounds for online vector bin packing
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels
- Variable neighborhood search
Cited in
(3)
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)
