h3. Link-uri utile

* Un 'articol':http://dspace.mit.edu/bitstream/1721.1/5146/1/OR-238-90.pdf care prezinta o solutie a acestei probleme avand complexitate optima $O(N*logN)$

* 'Sensitivity Analysis of the Economic Lot-Sizing Problem / MIT':http://dspace.mit.edu/bitstream/1721.1/5146/1/OR-238-90.pdf -> articolul prezinta o solutie a acestei probleme avand complexitatea optima $O(N*logN)$

h3. Probleme asemanatoare
* 'Euro / BOI 2003':problema/euro
* 'Yogurt Factory / USACO 2005':http://acm.pku.edu.cn/JudgeOnline/problem?id=2393

* 'Branza':problema/branza
* 'Rompetrol':problema/rompetrol

* 'Branza / preONI 2007':problema/branza
* 'Rompetrol / Autumn Warmup 2007':problema/rompetrol

h2. 'Cercuri3':problema/cercuri3

h3. Link-uri utile

* 'Information Dissemination in Restricted Routing Networks':http://citeseer.ist.psu.edu/186949.html -  in acest articol este prezentata o solutie de complexitate O(N^3^) la aceasta problema

* 'Information Dissemination in Restricted Routing Networks / CiteSeer':http://citeseer.ist.psu.edu/186949.html -> in acest articol este prezentata o solutie de complexitate O(N^3^) la aceasta problema

h2. 'Zvon':problema/zvon

h3. Probleme asemanatoare

* 'Consilul tribului / BOI 2003':problema/trib

* 'Consiliul tribului / BOI 2003':problema/trib

* 'Optic / Happy Coding 2007':problema/optic
h2. 'Cerc2':problema/cerc2

h3. Link-uri utile

* 'Cautari Ortogonale':downloads?cautari_ortogonale.doc , articol scris de Cosmin Negruseri
* 'Arbori de intervale':downloads?arbori_de_intervale.zip , articol scris de d-na. prof. Dana Lica
* 'Range Minimum Query and Lowest Common Ancestor':http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor , articol scris de catre Daniel Pasaila
* 'Orthogonal Range Queries':http://people.csail.mit.edu/indyk/6.838-old/handouts/lec5.pdf

* 'Cautari Ortogonale / infoarena':downloads?cautari_ortogonale.doc , articol scris de Cosmin Negruseri
* 'Arbori de intervale / infoarena':downloads?arbori_de_intervale.zip , articol scris de d-na. prof. Dana Lica
* 'Range Minimum Query and Lowest Common Ancestor / TopCoder':http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor , articol scris de catre Daniel Pasaila
* 'Orthogonal Range Queries / MIT':http://people.csail.mit.edu/indyk/6.838-old/handouts/lec5.pdf

h3. Probleme asemanatoare

* 'Obj / Happy Coding 2006':problema/obj
* 'Pawns / Bursele Agora 2004':problema/pawns
* 'Game / Bursele Agora 2004':problema/game

* 'Pietre':problema/pietre

* 'Pietre / infoarena':problema/pietre

* 'Otilia / .campion 2005':problema/otilia