Problema do empacotamento (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema do empacotamento" in Portuguese language version.

Last modified: 19:21:46, 9 August 2025 (UTC)

Ref.Un. Ref.Website

Global rank Portuguese rank

77doi.org

2^nd place

4^th place

44worldcat.org

4^th place

5^th place

22unibo.it

3,746^th place

5,549^th place

22web.archive.org

1^st place

11umass.edu

3,436^th place

4,074^th place

11aaaipress.org

low place

11ucla.edu

885^th place

987^th place

aaaipress.org (Global: low place; Portuguese: low place)

Korf 2002 Korf, Richard E. (2002), A new algorithm for optimal bin packing. (PDF), consultado em 8 de julho de 2016, cópia arquivada (PDF) em |arquivourl= requer |arquivodata= (ajuda) 🔗

doi.org (Global: 2^nd place; Portuguese: 4^th place)

dx.doi.org

Korte, Bernhard; Vygen, Jens (2006). «Bin-Packing». Combinatorial Optimization: Theory and Algorithms. Col: Algorithms and Combinatorics 21. [S.l.]: Springer. pp. 426–441. ISBN 978-3-540-25684-7. doi:10.1007/3-540-29297-7_18
Lewis 2009 Lewis, R. (2009), «A General-Purpose Hill-Climbing Method for Order Independent Minimum Grouping Problems: A Case Study in Graph Colouring and Bin Packing», Computers and Operations Research, 36 (7): 2295–2310, doi:10.1016/j.cor.2008.09.004
Yue 1991, pp. 321–331. Yue, Minyi (outubro 1991), «A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm», Acta Mathematicae Applicatae Sinica, ISSN 0168-9673, 7 (4): 321–331, doi:10.1007/BF02009683
Dósa 2007, pp. 1–11. Dósa, György (2007), «The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)≤(11/9)OPT(I)+6/9», in: Chen, Bo; Paterson, Mike; Zhang, Guochuan, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ISBN 978-3-540-74449-8, Springer Berlin / Heidelberg, ISSN 0302-9743, 4614/2007, pp. 1–11, doi:10.1007/978-3-540-74450-4
Garey & Johnson 1985, pp. 65–106. Garey, Michael R.; Johnson, David S. (1985), «A 71/60 theorem for bin packing*1», Journal of Complexity, 1: 65–106, doi:10.1016/0885-064X(85)90022-6
Yue & Zhang 1995, pp. 318–330. Yue, Minyi; Zhang, Lei (julho 1995), «A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm», Acta Mathematicae Applicatae Sinica, ISSN 0168-9673, 11 (3): 318–330, doi:10.1007/BF02011198
Fernandez de la Vega & Lueker 1981, pp. 349–355 Fernandez de la Vega, W.; Lueker, G. S. (dezembro 1981), «Bin packing can be solved within 1 + ε in linear time», Springer Berlin / Heidelberg, Combinatorica, ISSN 0209-9683, 1 (4): 349–355, doi:10.1007/BF02579456

ucla.edu (Global: 885^th place; Portuguese: 987^th place)

moose.cs.ucla.edu

Schreiber & Korf 2013 Schreiber, Ethan L.; Korf, Richard E. (2013), Improved Bin Completion for Optimal Bin Packing and Number Partitioning (PDF), ISBN 978-1-57735-633-2, IJCAI '13, Beijing, China: AAAI Press, pp. 651–658, consultado em 8 de julho de 2016, cópia arquivada (PDF) em |arquivourl= requer |arquivodata= (ajuda) 🔗

umass.edu (Global: 3,436^th place; Portuguese: 4,074^th place)

people.cs.umass.edu

Barrington, David Mix (2006). «Bin Packing»

unibo.it (Global: 3,746^th place; Portuguese: 5,549^th place)

or.deis.unibo.it

Martello & Toth 1990, p. 221 Martello, Silvano; Toth, Paolo (1990), «Bin-packing problem» (PDF), Knapsack Problems: Algorithms and Computer Implementations, ISBN 0471924202, Chichester, UK: John Wiley and Sons
Martello & Toth 1990, pp. 237–240. Martello, Silvano; Toth, Paolo (1990), «Bin-packing problem» (PDF), Knapsack Problems: Algorithms and Computer Implementations, ISBN 0471924202, Chichester, UK: John Wiley and Sons

web.archive.org (Global: 1^st place; Portuguese: 1^st place)

Korf 2002 Korf, Richard E. (2002), A new algorithm for optimal bin packing. (PDF), consultado em 8 de julho de 2016, cópia arquivada (PDF) em |arquivourl= requer |arquivodata= (ajuda) 🔗
Schreiber & Korf 2013 Schreiber, Ethan L.; Korf, Richard E. (2013), Improved Bin Completion for Optimal Bin Packing and Number Partitioning (PDF), ISBN 978-1-57735-633-2, IJCAI '13, Beijing, China: AAAI Press, pp. 651–658, consultado em 8 de julho de 2016, cópia arquivada (PDF) em |arquivourl= requer |arquivodata= (ajuda) 🔗

worldcat.org (Global: 4^th place; Portuguese: 5^th place)

Yue 1991, pp. 321–331. Yue, Minyi (outubro 1991), «A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm», Acta Mathematicae Applicatae Sinica, ISSN 0168-9673, 7 (4): 321–331, doi:10.1007/BF02009683
Dósa 2007, pp. 1–11. Dósa, György (2007), «The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)≤(11/9)OPT(I)+6/9», in: Chen, Bo; Paterson, Mike; Zhang, Guochuan, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ISBN 978-3-540-74449-8, Springer Berlin / Heidelberg, ISSN 0302-9743, 4614/2007, pp. 1–11, doi:10.1007/978-3-540-74450-4
Yue & Zhang 1995, pp. 318–330. Yue, Minyi; Zhang, Lei (julho 1995), «A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm», Acta Mathematicae Applicatae Sinica, ISSN 0168-9673, 11 (3): 318–330, doi:10.1007/BF02011198
Fernandez de la Vega & Lueker 1981, pp. 349–355 Fernandez de la Vega, W.; Lueker, G. S. (dezembro 1981), «Bin packing can be solved within 1 + ε in linear time», Springer Berlin / Heidelberg, Combinatorica, ISSN 0209-9683, 1 (4): 349–355, doi:10.1007/BF02579456

Problema do empacotamento (Portuguese Wikipedia)

aaaipress.org (Global: low place; Portuguese: low place)

doi.org (Global: 2nd place; Portuguese: 4th place)

dx.doi.org

ucla.edu (Global: 885th place; Portuguese: 987th place)

moose.cs.ucla.edu

umass.edu (Global: 3,436th place; Portuguese: 4,074th place)