Agroecology: the science of sustainable agriculture, 1995. ,
Agroecology: ecological process in sustainable agriculture ,
DOI : 10.1007/978-1-4612-3252-0
Agricultural sustainability and intensive production practices, Nature, vol.1, issue.6898, pp.671-677, 2002. ,
DOI : 10.1016/0305-750X(95)00162-6
Modelling optimal crop sequences using network flows, Agricultural Systems, vol.94, issue.2, pp.566-572, 2007. ,
DOI : 10.1016/j.agsy.2007.02.002
The Choice of Crop Rotation: A Modeling Approach and Case Study, American Journal of Agricultural Economics, vol.68, issue.1, pp.127-136, 1986. ,
DOI : 10.2307/1241657
Crop succession requirements in agricultural production planning, European Journal of Operational Research, vol.166, issue.2, pp.406-429, 2005. ,
DOI : 10.1016/j.ejor.2004.03.009
Crop rotation scheduling with adjacency constraints, Annals of Operations Research, vol.27, issue.3, pp.165-180, 2011. ,
DOI : 10.1007/s10479-008-0478-z
URL : https://hal.archives-ouvertes.fr/hal-01318382
A MIP flow model for crop-rotation planning in a context of forest sustainable development, Annals of Operations Research, vol.255, issue.1???2, pp.149-164, 2011. ,
DOI : 10.1007/s10479-009-0553-0
Sustainable vegetable crop supply problem, European Journal of Operational Research, vol.204, issue.3, pp.639-647, 2010. ,
DOI : 10.1016/j.ejor.2009.11.026
Sustainable vegetable crop supply problem with??perishable stocks, Annals of Operations Research, vol.18, pp.1-19, 2013. ,
DOI : 10.1007/s10479-010-0830-y
Models to support cropping plan and crop rotation decisions. a review, Agronomy for sustainable development, pp.567-580, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00930508
Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960. ,
DOI : 10.1287/opre.8.1.101
Probì emes de couverture en nombres entiers : génération de colonnes, heuristiques d'approximation garantie et schémas hybrides. applications en transport ferroviaire et en planification de production, p.13, 2011. ,
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications, Journal of the ACM, vol.25, issue.3, pp.499-508, 1978. ,
DOI : 10.1145/322077.322090
Selected Topics in Column Generation, Operations Research, vol.53, issue.6, pp.1007-1023, 2005. ,
DOI : 10.1287/opre.1050.0234
Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998. ,
DOI : 10.1287/opre.46.3.316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.197.7390
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000. ,
DOI : 10.1287/opre.48.1.111.12453
URL : https://hal.archives-ouvertes.fr/inria-00342641
Generic branch-cut-and-price, 2010. ,
Solving Large-Scale Zero-One Linear Programming Problems, Operations Research, vol.31, issue.5, pp.803-834, 1983. ,
DOI : 10.1287/opre.31.5.803
Separation algorithms for 0-1 knapsack polytopes, Mathematical Programming, vol.14, issue.1-2, pp.69-91, 2010. ,
DOI : 10.1007/s10107-010-0359-5
Lifted Cover Inequalities for 0-1 Integer Programs: Computation, INFORMS Journal on Computing, vol.10, issue.4, pp.427-437, 1998. ,
DOI : 10.1287/ijoc.10.4.427
Column Generation based Primal Heuristics, Electronic Notes in Discrete Mathematics, vol.36, pp.695-702, 2010. ,
DOI : 10.1016/j.endm.2010.05.088
URL : https://hal.archives-ouvertes.fr/hal-00790610