Miguel Constantino

Orcid: 0000-0001-7550-2740

According to our database1, Miguel Constantino authored at least 18 papers between 1996 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
An optimization approach to design forest road networks and plan timber transportation.
Oper. Res., 2022

2021
Robust Models for the Kidney Exchange Problem.
INFORMS J. Comput., 2021

2020
A multi-objective Monte Carlo tree search for forest harvest scheduling.
Eur. J. Oper. Res., 2020

2018
Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints.
Eur. J. Oper. Res., 2018

2017
Forest harvest scheduling with clearcut and core area constraints.
Ann. Oper. Res., 2017

2014
A stochastic approach to optimize Maritime pine (Pinus pinaster Ait.) stand management scheduling under fire risk. An application in Portugal.
Ann. Oper. Res., 2014

2013
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability.
Int. Trans. Oper. Res., 2013

Imposing Connectivity Constraints in Forest Planning Models.
Oper. Res., 2013

New insights on integer-programming models for the kidney exchange problem.
Eur. J. Oper. Res., 2013

2012
A branch-and-price approach for harvest scheduling subject to maximum area restrictions.
Comput. Optim. Appl., 2012

2011
Modeling forest core area with integer programming.
Ann. Oper. Res., 2011

2010
Mixing MIR inequalities with two divisible coefficients.
Math. Program., 2010

Effective formulation reductions for the quadratic assignment problem.
Comput. Oper. Res., 2010

2008
A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions.
Oper. Res., 2008

2005
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints.
Eur. J. Oper. Res., 2005

2000
A polyhedral approach to a production planning problem.
Ann. Oper. Res., 2000

1998
Lower Bounds in Lot-Sizing Models: A Polyhedral Study.
Math. Oper. Res., 1998

1996
A cutting plane approach to capacitated lot-sizing with start-up costs.
Math. Program., 1996


  Loading...