Karmarkar–Karp bin packing algorithms
id:
karmarkar-karp-bin-packing-algorithms-258-12699805
title:
Karmarkar–Karp bin packing algorithms
text:
The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem of packing items of different sizes into bins of identical capacity, such that the total number of bins is as small as possible. Finding the optimal solution is computationally hard. Karmarkar and Karp devised an algorithm that runs in polynomial time and finds a solution with at most O P T + O bins, where OPT is the number of bins in the op
brand slug:
wiki
category slug:
encyclopedia
description:
Set of related approximation algorithms for the bin packing problem
original url:
https://en.wikipedia.org/wiki/Karmarkar%E2%80%93Karp_bin_packing_algorithms
date created:
date modified:
2024-01-06T04:53:43Z
main entity:
{"identifier":"Q110555082","url":"https://www.wikidata.org/entity/Q110555082"}
image:
fields total:
13
integrity:
14