Lower bounds for a bin packing problem with linear usage cost
type: Item
instance of: scholarly article
title: Lower bounds for a bin packing problem with linear usage cost
zbMATH Open document ID: 1430.90477
author: R. Braune
published in: European Journal of Operational Research
publication date: 2019-01-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6998900
zbMATH Keywords: packing
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: lower bounds
zbMATH Keywords: performance ratio
zbMATH Keywords: branch and bound
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.10.004
OpenAlex ID: W2897983212
cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
cites work: On a dual version of the one-dimensional bin packing problem
cites work: On the generalized bin packing problem
cites work: An analysis of lower bound procedures for the bin packing problem
cites work: Computing the asymptotic worst-case of bin packing lower bounds
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Scheduling multiprocessor tasks for mean flow time criterion
cites work: An APTAS for Generalized Cost Variable-Sized Bin Packing
cites work: Bin packing with general cost structures
cites work: Q3624058
cites work: Heuristic solution of open bin packing problems
cites work: Relaxations and exact solution of the variable sized bin packing problem
cites work: An exact algorithm for the dual bin packing problem
cites work: Capacitated Vehicle Routing on Trees
cites work: On a generalized bin-packing problem
cites work: Bin‐packing problem with concave costs of bin utilization
cites work: Q3993418
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: New Bounds for Variable-Sized Online Bin Packing
cites work: An improved typology of cutting and packing problems
Wikidata QID: Q129037857
DOI: 10.1016/J.EJOR.2018.10.004
description: scientific article; zbMATH DE number 6998900