Suivre
Isabel Martins
Isabel Martins
Instituto Superior de Agronomia
Adresse e-mail validée de isa.utl.pt
Titre
Citée par
Citée par
Année
A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions
M Constantino, I Martins, JG Borges
Operations Research 56 (3), 542-551, 2008
1252008
A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old growth, and even flow constraints
F Caro, M Constantino, I Martins, A Weintraub
Forest Science 49 (5), 738-751, 2003
1052003
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
I Martins, M Constantino, JG Borges
European Journal of Operational Research 161 (2), 478-498, 2005
702005
Effects of site productivity on forest harvest scheduling subject to green-up and maximum area restrictions
P Borges, I Martins, E Bergseng, T Eid, T Gobakken
Scandinavian Journal of Forest Research 31 (5), 507-516, 2016
242016
Modelling the problem of food distribution by the Portuguese food banks
I Martins, T Guedes, P Rama, J Ramos, T Tchemisova
International Journal of Mathematical Modelling and Numerical Optimisation 2 …, 2011
222011
Forest management models with spatial structure constraints
I Martins, M Constantino, JG Borges
CIO/Faculdade de CiÍncias de Lisboa, Working Paper, 1999, 1999
221999
Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
I Martins, M Ye, M Constantino, M da Conceição Fonseca, J Cadima
Top 22, 343-362, 2014
202014
A branch‐and‐bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
T Neto, M Constantino, I Martins, JP Pedroso
International transactions in operational research 20 (5), 689-709, 2013
182013
A branch-and-price approach for harvest scheduling subject to maximum area restrictions
I Martins, F Alvelos, M Constantino
Computational Optimization and Applications 51, 363-385, 2012
182012
Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
M Constantino, I Martins
European Journal of Operational Research 265 (2), 723-734, 2018
122018
A multi-objective Monte Carlo tree search for forest harvest scheduling
T Neto, M Constantino, I Martins, JP Pedroso
European Journal of Operational Research 282 (3), 1115-1126, 2020
112020
Forest harvest scheduling with clearcut and core area constraints
T Neto, M Constantino, I Martins, JP Pedroso
Annals of Operations Research 258, 453-478, 2017
82017
Designing healthy ice creams with linear programming: An application using traditional Portuguese products
I Lopes, I Martins, M Mesquita, V Valença de Sousa, S Ferreira‐Dias
Journal of Food Process Engineering 41 (1), e12601, 2018
62018
Otimização de planos de exploração florestal em baldios do norte de Portugal
A Cerveira, I Martins, A Mota, J Bento, T Fonseca
Parte: http://hdl. handle. net/10316.2/35906, 2014
42014
Decompositions and a matheuristic for a forest harvest scheduling problem
I Martins, F Alvelos, M Constantino
Operational Research: IO 2013-XVI Congress of APDIO, Bragança, Portugal …, 2015
32015
An Integer Programming Model for the Management of a Forest in the North of Portugal
A Cerveira, T Fonseca, A Mota, I Martins
AIP Conference Proceedings 1389 (1), 1890-1893, 2011
32011
A Branch-and-cut Approach for Forest Management Models with Spatial Constraints
I Martins, M Constantino, JG Borges
Working Paper No. 4/2004, 2004
22004
A Network Flow Model for Forest Management Problems with Spatial Constraints
I Martins, M Constantino, JG Borges
CIO, Faculty of Sciences, University of Lisbon, 2005
12005
(Re) Thinking Earth: From Representations of Nature to Climate Change Fiction, 22-23 April 2020 in the National Library of Portugal, Lisbon
T Botelho, IO Martins
Science Fiction Studies 47 (1), 156-157, 2020
2020
Dantzig-Wolfe reformulations for the forest harvest scheduling subject to maximum area restrictions
I Martins, FP Alvelos, M Constantino, R Magalhães
UA-Instituto de Telecomunicações, 2013
2013
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20