Mathematical programming algorithms for bin packing problems with item fragmentation
From MaRDI portal
Publication:336982
DOI10.1016/J.COR.2013.12.008zbMATH Open1348.90536OpenAlexW2088827022MaRDI QIDQ336982FDOQ336982
Authors: Marco Casazza, Alberto Ceselli 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.12.008
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- SCIP: solving constraint integer programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- Handbooks in operations Research \& management science: Transportation
- LP models for bin packing and cutting stock problems
- Branching in branch-and-price: A generic scheme
- Decomposition Principle for Linear Programs
- Vehicle routing problems with split deliveries
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Using extra dual cuts to accelerate column generation
- The Bin Packing Problem with Precedence Constraints
- Complexity of fragmentable object bin packing and an application
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Title not available (Why is that?)
- Approximation and Online Algorithms
- Minimizing makespan and preemption costs on a system of uniform machines
- Parallelism versus memory allocation in pipelined router forwarding engines
Cited In (17)
- The bin packing problem with item fragmentation: a worst-case analysis
- Analysis of transmissions scheduling with packet fragmentation
- Integer optimization with penalized fractional values: the knapsack case
- Approximation issues of fractional knapsack with penalties: a note
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- Resource loading with time windows
- Mathematical programming algorithms for bin packing problems with item fragmentation
- New formulations for variable cost and size bin packing problems with item fragmentation
- Procedures for the bin packing problem with precedence constraints
- Title not available (Why is that?)
- Online bin packing of fragile objects with application in cellular networks
- Exactly solving packing problems with fragmentation
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
- Column generation for the variable cost and size bin packing problem with fragmentation
- A study on load-balanced variants of the bin packing problem
- Numerical optimization method for packing regular convex polygons
- Bin packing problem with conflicts and item fragmentation
Uses Software
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)
