Two-bar charts packing problem (Q2047190)

From MaRDI portal

Revision as of 11:17, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Two-bar charts packing problem	scientific article

Statements

scholarly article

0 references

Two-bar charts packing problem (English)

0 references

zbMATH Open document ID

0 references

10.1007/s11590-020-01657-1

0 references

0 references

Stepan Nazarenko

0 references

Roman Plotnikov

0 references

0 references

Optimization Letters

0 references

publication date

19 August 2021

0 references

full work available at URL

https://arxiv.org/abs/2005.14195

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

bar chart

0 references

strip packing

0 references

APX

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Orthogonal Packings in Two Dimensions

0 references

A new proof for the first-fit decreasing bin-packing algorithm

0 references

Improved Approximation for Vector Bin Packing

0 references

Approximation and online algorithms for multidimensional bin packing: a survey

0 references

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

0 references

Combinatorial Benders' Cuts for the Strip Packing Problem

0 references

The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

0 references

Optimal Investment in the Development of Oil and Gas Field

0 references

0 references

On some implementations of solving the resource constrained project scheduling problems

0 references

0 references

Genetic algorithm for the resource-constrained project scheduling problem

0 references

Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

0 references

A \((5/3+\varepsilon)\)-approximation for strip packing

0 references

A self-adapting genetic algorithm for project scheduling under resource constraints

0 references

A 71/60 theorem for bin packing

0 references

PSPLIB -- a project scheduling problem library

0 references

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

0 references

Experimental investigation of heuristics for resource-constrained project scheduling: an update

0 references

A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

0 references

The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\)

0 references

Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution

0 references

A 2.5 times optimal algorithm for packing in two dimensions

0 references

A Strip-Packing Algorithm with Absolute Performance Bound 2

0 references

A branch-and-price algorithm for the two-dimensional vector packing problem

0 references

A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm

0 references

A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2047190

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2047190&oldid=36707523"