Three-Bar Charts Packing Problem
From MaRDI portal
Publication:6090762
DOI10.1007/978-3-031-22990-9_5OpenAlexW4313343176MaRDI QIDQ6090762
Publication date: 17 November 2023
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22990-9_5
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- A 71/60 theorem for bin packing
- 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
- The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\)
- Maximum ATSP with weights zero and one via half-edges
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- A 3/2-approximation for big two-bar charts packing
- Two-bar charts packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- A new proof for the first-fit decreasing bin-packing algorithm
- Improved Approximation for Vector Bin Packing
- An -approximation algorithm for the asymmetric maximum TSP
- Optimal Investment in the Development of Oil and Gas Field
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Three-Bar Charts Packing Problem
