Discovering and certifying lower bounds for the online bin stretching problem
type: Item
instance of: scholarly article
title: Discovering and certifying lower bounds for the online bin stretching problem
author: Martin Böhm
author: Bertrand Simon
published in: Theoretical Computer Science
publication date: 2022-10-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/2001.01125
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7605950
zbMATH Keywords: online bin stretching
zbMATH Keywords: online lower bound
zbMATH Keywords: certifying algorithms
zbMATH Keywords: proof assistant
describes a project that uses: Isabelle/HOL
describes a project that uses: LEDA
describes a project that uses: binstretch
describes a project that uses: Coq
describes a project that uses: OpenMPI
MaRDI profile type: Publication
OpenAlex ID: W2997451510
cites work: On-line bin-stretching
cites work: Semi on-line algorithms for the partition problem
cites work: Better Algorithms for Online Bin Stretching
cites work: Improved lower bounds for the online bin stretching problem
cites work: Online bin stretching with three bins
cites work: Designing programs that check their work
cites work: A framework for the verification of certifying computations
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: Certifying algorithms
cites work: Trustworthy Graph Algorithms (Invited Talk)
DOI: 10.1016/J.TCS.2022.10.004
description: scientific article; zbMATH DE number 7605950