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
11
TITLE:
Mixing MIR inequalities with two divisible coefficients
Full Text
AUTHORS:
Miguel Constantino
; Andrew J Miller; Mathieu Van Vyve;
PUBLISHED:
2010
,
SOURCE:
MATHEMATICAL PROGRAMMING,
VOLUME:
123,
ISSUE:
2
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
12
TITLE:
Strong formulation for the spot 5 daily photograph scheduling problem
Full Text
AUTHORS:
Glaydston Mattos Ribeiro
;
Miguel Fragoso Constantino
;
Luiz Antonio N Nogueira Lorena
;
PUBLISHED:
2010
,
SOURCE:
JOURNAL OF COMBINATORIAL OPTIMIZATION,
VOLUME:
20,
ISSUE:
4
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
13
TITLE:
A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions
Full Text
AUTHORS:
Miguel Constantino
;
Isabel Martins
;
Jose G Borges
;
PUBLISHED:
2008
,
SOURCE:
OPERATIONS RESEARCH,
VOLUME:
56,
ISSUE:
3
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
14
TITLE:
Lifting two-integer knapsack inequalities
Full Text
AUTHORS:
Agra, A
;
Constantino, MF
;
PUBLISHED:
2007
,
SOURCE:
MATHEMATICAL PROGRAMMING,
VOLUME:
109,
ISSUE:
1
INDEXED IN:
Scopus
WOS
CrossRef
:
10
IN MY:
ORCID
15
TITLE:
Reformulation by discretization: Application to economic lot sizing
Full Text
AUTHORS:
Miguel Constantino
;
Luis Gouveia
;
PUBLISHED:
2007
,
SOURCE:
OPERATIONS RESEARCH LETTERS,
VOLUME:
35,
ISSUE:
5
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
16
TITLE:
Description of 2-integer continuous knapsack polyhedra
Full Text
AUTHORS:
Agra, A
;
Constantinob, M
;
PUBLISHED:
2006
,
SOURCE:
DISCRETE OPTIMIZATION,
VOLUME:
3,
ISSUE:
2
INDEXED IN:
Scopus
WOS
CrossRef
:
10
IN MY:
ORCID
17
TITLE:
Polyhedral description of the integer single node flow set with constant bounds
Full Text
AUTHORS:
Agra, A
;
Constantino, MF
;
PUBLISHED:
2006
,
SOURCE:
8th Aussois Workshop on Combinatorial Optimization
in
MATHEMATICAL PROGRAMMING,
VOLUME:
105,
ISSUE:
2-3
INDEXED IN:
Scopus
WOS
CrossRef
:
2
IN MY:
ORCID
18
TITLE:
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
Full Text
AUTHORS:
Martins, I
;
Constantino, M
;
Borges, JG
;
PUBLISHED:
2005
,
SOURCE:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,
VOLUME:
161,
ISSUE:
2
INDEXED IN:
Scopus
WOS
CrossRef
IN MY:
ORCID
19
TITLE:
A 2-Opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old growth and even flow constraints
AUTHORS:
Caro, F;
Constantino, M
;
Martins, I
;
Weintraub, A
;
PUBLISHED:
2003
,
SOURCE:
FOREST SCIENCE,
VOLUME:
49,
ISSUE:
5
INDEXED IN:
Scopus
WOS
IN MY:
ORCID
20
TITLE:
A polyhedral approach to a production planning problem
Full Text
AUTHORS:
Constantino, M
;
PUBLISHED:
2000
,
SOURCE:
2nd ALIO/EURO Workshop on Practical Combinatorial Optimization
in
ANNALS OF OPERATIONS RESEARCH,
VOLUME:
96,
ISSUE:
1-4
INDEXED IN:
Scopus
WOS
CrossRef
:
8
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 2 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
Please select which records must be used by Authenticus!
×
Preview Publications
© 2024 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service