Mathematical programming algorithms for bin packing problems with item fragmentation
From MaRDI portal
Publication:336982
Recommendations
- The bin packing problem with item fragmentation: a worst-case analysis
- Bin packing with fragmentable items: presentation and approximations
- Exact algorithms for the bin packing problem with fragile objects
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Approximation and Online Algorithms
- Approximation schemes for packing with item fragmentation
- Complexity of fragmentable object bin packing and an application
- scientific article; zbMATH DE number 1830744
- Bin packing with restricted item fragmentation
- Bin packing problem with conflicts and item fragmentation
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1830744 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Approximation and Online Algorithms
- Approximation schemes for packing splittable items with cardinality constraints
- Branching in branch-and-price: A generic scheme
- Complexity of fragmentable object bin packing and an application
- Decomposition Principle for Linear Programs
- Handbooks in operations Research \& management science: Transportation
- Improved results for a memory allocation problem
- LP models for bin packing and cutting stock problems
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Minimizing makespan and preemption costs on a system of uniform machines
- Parallelism versus memory allocation in pipelined router forwarding engines
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- SCIP: solving constraint integer programs
- The bin packing problem with precedence constraints
- Using extra dual cuts to accelerate column generation
- Vehicle routing problems with split deliveries
Cited in
(21)- Approximation issues of fractional knapsack with penalties: a note
- Bin packing with fragmentable items: presentation and approximations
- Exactly solving packing problems with fragmentation
- Bin packing problem with conflicts and item fragmentation
- Integer optimization with penalized fractional values: the knapsack case
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- Exact algorithms for the bin packing problem with fragile objects
- A study on load-balanced variants of the bin packing problem
- The bin packing problem with item fragmentation: a worst-case analysis
- Online bin packing of fragile objects with application in cellular networks
- Resource loading with time windows
- New formulations for variable cost and size bin packing problems with item fragmentation
- Analysis of transmissions scheduling with packet fragmentation
- Procedures for the bin packing problem with precedence constraints
- Numerical optimization method for packing regular convex polygons
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
- scientific article; zbMATH DE number 1830744 (Why is no real title available?)
- Column generation for the variable cost and size bin packing problem with fragmentation
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Bin packing with restricted item fragmentation
- Lower and upper bounds for the bin packing problem with fragile objects
This page was built for publication: Mathematical programming algorithms for bin packing problems with item fragmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336982)
