Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bin_packing_problem> ?p ?o }
Showing triples 1 to 80 of
80
with 100 triples per page.
- Bin_packing_problem abstract "In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-complete problem.There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on. They have many applications, such as filling up containers, loading trucks with weight capacity constraints, creating file backups in media and technology mapping in Field-programmable gate array semiconductor chip design.The bin packing problem can also be seen as a special case of the cutting stock problem. When the number of bins is restricted to 1 and each item is characterised by both a volume and a value, the problem of maximising the value of items that can fit in the bin is known as the knapsack problem.Despite the fact that the bin packing problem has an NP-hard computational complexity, optimal solutions to very large instances of the problem can be produced with sophisticated algorithms. In addition, many heuristics have been developed: for example, the first fit algorithm provides a fast but often non-optimal solution, involving placing each item into the first bin in which it will fit. It requires Θ(n log n) time, where n is the number of elements to be packed. The algorithm can be made much more effective by first sorting the list of elements into decreasing order (sometimes known as the first-fit decreasing algorithm), although this still does not guarantee an optimal solution, and for longer lists may increase the running time of the algorithm. It is known, however, that there always exists at least one ordering of items that allows first-fit to produce an optimal solution.A variant of bin packing that occurs in practice is when items can share space when packed into a bin. Specifically, a set of items could occupy less space when packed together than the sum of their individual sizes. This variant is known as VM packing since when virtual machines (VMs) are packed in a server, their total memory requirement could decrease due to pages shared by the VMs that need only be stored once. If items can share space in arbitrary ways, the bin packing problem is hard to even approximate. However, if the space sharing fits into a hierarchy, as is the case with memory sharing in virtual machines, the bin packing problem can be efficiently approximated.".
- Bin_packing_problem wikiPageExternalLink AAAI02-110.pdf.
- Bin_packing_problem wikiPageExternalLink Problems.
- Bin_packing_problem wikiPageExternalLink caparf.
- Bin_packing_problem wikiPageExternalLink citation.cfm?id=3833&jmp=abstract&dl=portal&dl=ACM.
- Bin_packing_problem wikiPageExternalLink BPP.
- Bin_packing_problem wikiPageExternalLink fpart.
- Bin_packing_problem wikiPageExternalLink bpp-spreadsheet-solver.
- Bin_packing_problem wikiPageExternalLink vpsolver.dcc.fc.up.pt.
- Bin_packing_problem wikiPageExternalLink Csharp-Bin-Packing-Cutting-Stock-Solver.
- Bin_packing_problem wikiPageExternalLink erick_dube_507-034.pdf.
- Bin_packing_problem wikiPageExternalLink bin-packing.
- Bin_packing_problem wikiPageExternalLink 74_04_one_dimensional_packing.pdf.
- Bin_packing_problem wikiPageExternalLink www.optaplanner.org.
- Bin_packing_problem wikiPageExternalLink 2027-PHP-Pack-files-without-exceeding-a-given-size-limit.html.
- Bin_packing_problem wikiPageExternalLink watch?v=HWD207zxm8Q.
- Bin_packing_problem wikiPageID "287015".
- Bin_packing_problem wikiPageLength "16808".
- Bin_packing_problem wikiPageOutDegree "35".
- Bin_packing_problem wikiPageRevisionID "707168511".
- Bin_packing_problem wikiPageWikiLink APX.
- Bin_packing_problem wikiPageWikiLink Approximation_algorithm.
- Bin_packing_problem wikiPageWikiLink Backup.
- Bin_packing_problem wikiPageWikiLink Big_O_notation.
- Bin_packing_problem wikiPageWikiLink Category:Optimization_algorithms_and_methods.
- Bin_packing_problem wikiPageWikiLink Category:Packing_problems.
- Bin_packing_problem wikiPageWikiLink Category:Strongly_NP-complete_problems.
- Bin_packing_problem wikiPageWikiLink Combinatorics.
- Bin_packing_problem wikiPageWikiLink Computational_complexity_theory.
- Bin_packing_problem wikiPageWikiLink Cutting_stock_problem.
- Bin_packing_problem wikiPageWikiLink Field-programmable_gate_array.
- Bin_packing_problem wikiPageWikiLink Greedy_algorithm.
- Bin_packing_problem wikiPageWikiLink Guillotine_problem.
- Bin_packing_problem wikiPageWikiLink Heuristic_(computer_science).
- Bin_packing_problem wikiPageWikiLink Integrated_circuit.
- Bin_packing_problem wikiPageWikiLink Knapsack_problem.
- Bin_packing_problem wikiPageWikiLink Memory_management.
- Bin_packing_problem wikiPageWikiLink Multiprocessor_scheduling.
- Bin_packing_problem wikiPageWikiLink NP-completeness.
- Bin_packing_problem wikiPageWikiLink Online_algorithm.
- Bin_packing_problem wikiPageWikiLink OpenOpt.
- Bin_packing_problem wikiPageWikiLink OptaPlanner.
- Bin_packing_problem wikiPageWikiLink Packing_problems.
- Bin_packing_problem wikiPageWikiLink Page_(computer_memory).
- Bin_packing_problem wikiPageWikiLink Partition_of_a_set.
- Bin_packing_problem wikiPageWikiLink Partition_problem.
- Bin_packing_problem wikiPageWikiLink Polynomial-time_approximation_scheme.
- Bin_packing_problem wikiPageWikiLink Sorting.
- Bin_packing_problem wikiPageWikiLink Subset_sum_problem.
- Bin_packing_problem wikiPageWikiLink Sun_Ultra_series.
- Bin_packing_problem wikiPageWikiLink VPSolver.
- Bin_packing_problem wikiPageWikiLink Virtual_machine.
- Bin_packing_problem wikiPageWikiLinkText "Bin Packing Problem".
- Bin_packing_problem wikiPageWikiLinkText "Bin packing problem".
- Bin_packing_problem wikiPageWikiLinkText "bin packing problem".
- Bin_packing_problem wikiPageWikiLinkText "bin packing".
- Bin_packing_problem wikiPageWikiLinkText "first-fit algorithm".
- Bin_packing_problem wikiPageUsesTemplate Template:=.
- Bin_packing_problem wikiPageUsesTemplate Template:Citation.
- Bin_packing_problem wikiPageUsesTemplate Template:Packing_problem.
- Bin_packing_problem wikiPageUsesTemplate Template:Refimprove.
- Bin_packing_problem wikiPageUsesTemplate Template:Reflist.
- Bin_packing_problem subject Category:Optimization_algorithms_and_methods.
- Bin_packing_problem subject Category:Packing_problems.
- Bin_packing_problem subject Category:Strongly_NP-complete_problems.
- Bin_packing_problem type Algorithm.
- Bin_packing_problem comment "In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-complete problem.There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on.".
- Bin_packing_problem label "Bin packing problem".
- Bin_packing_problem sameAs Q814581.
- Bin_packing_problem sameAs Behälterproblem.
- Bin_packing_problem sameAs Problème_de_bin_packing.
- Bin_packing_problem sameAs ビンパッキング問題.
- Bin_packing_problem sameAs m.01q4sl.
- Bin_packing_problem sameAs Задача_об_упаковке_в_контейнеры.
- Bin_packing_problem sameAs Проблем_паковања_у_простору.
- Bin_packing_problem sameAs Задача_про_пакування_в_ємності.
- Bin_packing_problem sameAs Q814581.
- Bin_packing_problem sameAs 集装优化.
- Bin_packing_problem wasDerivedFrom Bin_packing_problem?oldid=707168511.
- Bin_packing_problem isPrimaryTopicOf Bin_packing_problem.