Bin packing problem with conflicts and item fragmentation
type: Item
instance of: scholarly article
title: Bin packing problem with conflicts and item fragmentation
author: Ali Ekici
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350517
zbMATH Keywords: bin packing problem with conflicts
zbMATH Keywords: item fragmentation
zbMATH Keywords: heuristic
zbMATH Keywords: lower bound
zbMATH Keywords: oversized items
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105113
OpenAlex ID: W3091308197
cites work: Branch-and-cut algorithms for the split delivery vehicle routing problem
cites work: Heuristics for determining the number of warehouses for storing non-compatible products
cites work: The bin packing problem with item fragmentation: a worst-case analysis
cites work: An analysis of lower bound procedures for the bin packing problem
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Lower bounds for a bin packing problem with linear usage cost
cites work: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
cites work: New formulations for variable cost and size bin packing problems with item fragmentation
cites work: Mathematical programming algorithms for bin packing problems with item fragmentation
cites work: Exactly solving packing problems with fragmentation
cites work: Q4083324
cites work: Q3048611
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Q3347319
cites work: Computing the asymptotic worst-case of bin packing lower bounds
cites work: New bin packing fast lower bounds
cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: The Loading Problem
cites work: A branch-and-price algorithm for the bin packing problem with conflicts
cites work: Improved results for a memory allocation problem
cites work: Approximation schemes for packing splittable items with cardinality constraints
cites work: New classes of fast lower bounds for bin packing problems
cites work: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
cites work: New heuristics for one-dimensional bin-packing
cites work: Q4198056
cites work: Heuristics and lower bounds for the bin packing problem with conflicts
cites work: Bin packing problems in one dimension: Heuristic solutions and confidence intervals
cites work: Applying tabu search with influential diversification to multiprocessor scheduling
cites work: An approximation scheme for bin packing with conflicts
cites work: Approximation algorithms for combinatorial problems
cites work: Column generation based primal heuristics
cites work: New lower bounds for bin packing problems with conflicts
cites work: The min-conflict packing problem
cites work: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
cites work: Capacitated Vehicle Routing on Trees
cites work: Bin packing with fragmentable items: presentation and approximations
cites work: Bin‐packing problem with concave costs of bin utilization
cites work: Solving the one-dimensional bin packing problem with a weight annealing heuristic
cites work: An exact approach for the vertex coloring problem
cites work: Complexity of fragmentable object bin packing and an application
cites work: Q3993418
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: Algorithms for the bin packing problem with conflicts
cites work: Bin packing with restricted item fragmentation
cites work: Hybrid genetic algorithms for bin-packing and related problems
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: Approximation schemes for packing with item fragmentation
cites work: Q4290987
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Branching in branch-and-price: A generic scheme
cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem
DOI: 10.1016/J.COR.2020.105113
description: scientific article; zbMATH DE number 7350517