Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Miguel Fragoso Constantino
AuthID:
R-000-D8X
Publications
Confirmed
To Validate
Document Source:
All
Document Type:
All Document Types
Article (21)
Article in Press (2)
Year Start - End:
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
-
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
Order:
Year Dsc
Year Asc
Cit. WOS Dsc
IF WOS Dsc
Cit. Scopus Dsc
IF Scopus Dsc
Title Asc
Title Dsc
Results:
10
20
30
40
50
Confirmed Publications: 23
1
TITLE:
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Full Text
AUTHORS:
Teresa Neto
;
Miguel Constantino
;
Isabel Martins
;
Joao Pedro Pedroso
;
PUBLISHED:
2013
,
SOURCE:
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH,
VOLUME:
20,
ISSUE:
5
INDEXED IN:
Scopus
WOS
DBLP
CrossRef
:
13
IN MY:
ORCID
2
TITLE:
Imposing Connectivity Constraints in Forest Planning Models
Full Text
AUTHORS:
Rodolfo Carvajal;
Miguel Constantino
; Marcos Goycoolea; Juan Pablo Vielma;
Andres Weintraub
;
PUBLISHED:
2013
,
SOURCE:
OPERATIONS RESEARCH,
VOLUME:
61,
ISSUE:
4
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
3
TITLE:
New insights on integer-programming models for the kidney exchange problem
Full Text
AUTHORS:
Miguel Constantino
;
Xenia Klimentova
;
Ana Viana
;
Abdur Rais
;
PUBLISHED:
2013
,
SOURCE:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,
VOLUME:
231,
ISSUE:
1
INDEXED IN:
Scopus
WOS
CrossRef
:
39
IN MY:
ORCID
4
TITLE:
A branch-and-price approach for harvest scheduling subject to maximum area restrictions
Full Text
AUTHORS:
Isabel Martins
;
Filipe Alvelos
;
Miguel Constantino
;
PUBLISHED:
2012
,
SOURCE:
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS,
VOLUME:
51,
ISSUE:
1
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
5
TITLE:
Mixing polyhedra with two non divisible coefficients
Full Text
AUTHORS:
Agostinho Agra
;
Miguel Constantino
;
PUBLISHED:
2012
,
SOURCE:
MATHEMATICAL PROGRAMMING,
VOLUME:
135,
ISSUE:
1-2
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
6
TITLE:
Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
Full Text
AUTHORS:
Martins, I
; Ye, M;
Constantino, M
; da Conceicao Fonseca, M;
Cadima, J
;
PUBLISHED:
2012
,
SOURCE:
TOP,
VOLUME:
22,
ISSUE:
1
INDEXED IN:
Scopus
CrossRef
IN MY:
ORCID
7
TITLE:
A stochastic approach to optimize Maritime pine (Pinus pinaster Ait.) stand management scheduling under fire risk. An application in Portugal
AUTHORS:
Ferreira, L
;
Constantino, M
;
Borges, JG
;
PUBLISHED:
2011
,
SOURCE:
Annals of Operations Research
INDEXED IN:
Scopus
8
TITLE:
Modeling forest core area with integer programming
Full Text
AUTHORS:
Huizhen Z Zhang;
Miguel Constantino
;
Andre Falcao
;
PUBLISHED:
2011
,
SOURCE:
ANNALS OF OPERATIONS RESEARCH,
VOLUME:
190,
ISSUE:
1
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
9
TITLE:
A compact formulation of a mixed-integer set
Full Text
AUTHORS:
Agostinho Agra
;
Miguel Constantino
;
PUBLISHED:
2010
,
SOURCE:
OPTIMIZATION,
VOLUME:
59,
ISSUE:
5
INDEXED IN:
Scopus
WOS
CrossRef
:
1
IN MY:
ORCID
10
TITLE:
Effective formulation reductions for the quadratic assignment problem
Full Text
AUTHORS:
Huizhen Z Zhang;
Cesar Beltran Royo
;
Miguel Constantino
;
PUBLISHED:
2010
,
SOURCE:
COMPUTERS & OPERATIONS RESEARCH,
VOLUME:
37,
ISSUE:
11
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
Add to Marked List
Check All
Export
×
Publication Export Settings
BibTex
EndNote
APA
CSV
PDF
Export Preview
Print
×
Publication Print Settings
HTML
PDF
Print Preview
Page 1 of 3. Total results: 23.
<<
<
1
2
3
>
>>
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service