Lower bounds for a bin packing problem with linear usage cost

DOI10.1016/j.ejor.2018.10.004zbMath1430.90477OpenAlexW2897983212WikidataQ129037857 ScholiaQ129037857MaRDI QIDQ1755229

Roland Braune

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.004

zbMATH Keywords

combinatorial optimizationbranch and boundpackinglower boundsperformance ratio

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (3)

Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Uses Software

• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxations and exact solution of the variable sized bin packing problem
• Lower bounds and reduction procedures for the bin packing problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• An analysis of lower bound procedures for the bin packing problem
• An exact algorithm for the dual bin packing problem
• Scheduling multiprocessor tasks for mean flow time criterion
• Bin packing with general cost structures
• Heuristic solution of open bin packing problems
• An improved typology of cutting and packing problems
• Computing the asymptotic worst-case of bin packing lower bounds
• On a dual version of the one-dimensional bin packing problem
• On a generalized bin-packing problem
• An APTAS for Generalized Cost Variable-Sized Bin Packing
• Capacitated Vehicle Routing on Trees
• Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
• New Bounds for Variable-Sized Online Bin Packing
• On the generalized bin packing problem
• Bin‐packing problem with concave costs of bin utilization

This page was built for publication: Lower bounds for a bin packing problem with linear usage cost