Artigo em revista |
- Agostinho Agra; Cristina Requejo. "Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem". EURO
Journal on Computational Optimization (2024): https://doi.org/10.1016/j.ejco.2023.100081.
10.1016/j.ejco.2023.100081
- Raquel Matos; Hugo Rodrigues; Anibal Costa; Cristina Requejo; Fernanda Rodrigues. "Facility manager perspectives on building
condition assessment for Portuguese higher education institutions". Building Research & Information (2023): http://hdl.handle.net/10773/38329.
10.1080/09613218.2023.2204415
- Filipe Rodrigues; Agostinho Agra; Lars Magnus Hvattum; Cristina Requejo. "Weighted iterated local branching for mathematical
programming problems with binary variables". Journal of Heuristics 28 3 (2022): 329-350. http://hdl.handle.net/10773/35033.
10.1007/s10732-022-09496-2
- Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina. "Weighted proximity search". Journal of Heuristics
(2021): https://doi.org/10.1007/s10732-021-09466-0.
10.1007/s10732-021-09466-0
- Fajarda, Olga; Requejo, Cristina. "MIP model-based heuristics for the minimum weighted tree reconstruction problem". Operational
Research (2020): https://doi.org/10.1007/s12351-020-00608-z.
10.1007/s12351-020-00608-z
- Rodrigues, Filipe; Agra, Agostinho; Requejo, Cristina; Delage, Erick. "Lagrangian Duality for Robust Problems with Decomposable
Functions: The Case of a Robust Inventory Problem". INFORMS Journal on Computing (2020): https://doi.org/10.1287/ijoc.2020.0978.
10.1287/ijoc.2020.0978
- Cappanera, Paola; Requejo, Cristina; Scutellà, Maria Grazia. "Temporal constraints and device management for the Skill VRP:
mathematical model and lower bounding techniques". Computers & Operations Research 124 (2020): 105054-105054. http://hdl.handle.net/10773/29827.
10.1016/j.cor.2020.105054
- Requejo, Cristina; Santos, Eulália. "Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem
using simple Lagrangian based algorithms". Operational Research (2020): http://hdl.handle.net/10773/29828.
10.1007/s12351-018-0426-x
- Rodrigues, Filipe; Agra, Agostinho; Christiansen, Marielle; Hvattum, Lars Magnus; Requejo, Cristina. "Comparing techniques
for modelling uncertainty in a maritime inventory routing problem". European Journal of Operational Research (2019):
https://doi.org/10.1016/j.ejor.2019.03.015.
10.1016/j.ejor.2019.03.015
- Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina. "A computational comparison of compact MILP formulations for
the zero forcing number". Discrete Applied Mathematics (2019): https://doi.org/10.1016/j.dam.2019.03.027.
10.1016/j.dam.2019.03.027
- Filipe Rodrigues; Cristina Requejo. "Suppliers selection problem with quantity discounts and price changes: a heuristic approach".
RAIRO - Operations Research 53 3 (2019): 887-901. http://hdl.handle.net/10773/27229.
10.1051/ro/2017075
- Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe. "An adjustable sample average approximation algorithm for the stochastic
production-inventory-routing problem". Networks (2018): http://hdl.handle.net/10773/24196.
10.1002/net.21796
- Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe. "A hybrid heuristic for a stochastic production-inventory-routing problem".
(2018): http://hdl.handle.net/10773/24193.
10.1016/j.endm.2018.02.009
- Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina. "A decomposition approach for the p-median problem on disconnected
graphs". Computers and Operations Research 86 (2017): 79-85. http://hdl.handle.net/10773/18403.
10.1016/j.cor.2017.05.006
- Fortz, Bernard; Requejo, Cristina; Oliveira, Olga. "Compact mixed integer linear programming models to the Minimum Weighted
Tree Reconstruction problem". European Journal of Operational Research 256 1 (2017): 242-251. http://hdl.handle.net/10773/17238.
10.1016/j.ejor.2016.06.014
- Agra, Agostinho; Figueiredo, Rosa; Lavor, Carlile; Maculan, Nelson; Pereira, António; Requejo, Cristina. "Feasibility check
for the distance geometry problem: an application to molecular conformations". International Transactions in Operational
Research (2017): http://hdl.handle.net/10773/18405.
10.1111/itor.12283
- Agra, Agostinho; Requejo, Cristina; Santos, Eulália. "Implicit cover inequalities". Journal of Combinatorial Optimization
31 3 (2016): 1111-1129. http://www.scopus.com/inward/record.url?eid=2-s2.0-84961050932&partnerID=MN8TOARS.
10.1007/s10878-014-9812-3
- Agra, A.; Cerdeira, J.O.; Requejo, C.. "Using decomposition to improve greedy solutions of the optimal diversity management
problem". International Transactions in Operational Research 20 5 (2013): 617-625. http://www.scopus.com/inward/record.url?eid=2-s2.0-84881012952&partnerID=MN8TOARS.
10.1111/itor.12004
- Agra, A.; Christiansen, M.; Figueiredo, R.; Hvattum, L.M.; Poss, M.; Requejo, C.. "The robust vehicle routing problem with
time windows". Computers and Operations Research 40 3 (2013): 856-866. http://www.scopus.com/inward/record.url?eid=2-s2.0-84870237221&partnerID=MN8TOARS.
10.1016/j.cor.2012.10.002
- Agra, A.; Christiansen, M.; Figueiredo, R.; Magnus Hvattum, L.; Poss, M.; Requejo, C.. "Layered formulation for the robust
vehicle routing problem with time windows". Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics) 7422 LNCS (2012): 249-260. http://www.scopus.com/inward/record.url?eid=2-s2.0-84865257974&partnerID=MN8TOARS.
10.1007/978-3-642-32147-4_23
- Orestes Cerdeira, J.; Figueiredo, R.M.V.; Pereira, A.; Requejo, C.. "Scheduling with sequence-dependent batch setup times:
Planning tests for a pharmaceutic industry". International Journal of Mathematical Modelling and Numerical Optimisation
2 3 (2011): 273-287. http://www.scopus.com/inward/record.url?eid=2-s2.0-84858376941&partnerID=MN8TOARS.
10.1504/IJMMNO.2011.040792
- Morais, Rui Manuel; Pavan, Claunir; Pinto, Armando Nolasco; Requejo, Cristina. "Genetic algorithm for the topological design
of survivable optical transport networks". Journal of Optical Communications and Networking 3 1 (2011): 17-26. http://www.scopus.com/inward/record.url?eid=2-s2.0-79952902676&partnerID=MN8TOARS.
10.1364/JOCN.3.000017
- Requejo, C.; Santos, E.. "Greedy heuristics for the diameter-constrained minimum spanning tree problem". Journal of Mathematical
Sciences 161 6 (2009): 930-943. http://www.scopus.com/inward/record.url?eid=2-s2.0-70350343114&partnerID=MN8TOARS.
10.1007/s10958-009-9611-z
- Agra, A.; Gouveia, L.; Requejo, C.. "Extended formulations for the cardinality constrained subtree of a tree problem". Operations
Research Letters 37 3 (2009): 192-196. http://www.scopus.com/inward/record.url?eid=2-s2.0-64949184629&partnerID=MN8TOARS.
10.1016/j.orl.2009.02.002
- Agra, A.; Requejo, C.. "The linking set problem: A polynomial special case of the multiple-choice knapsack problem". Journal
of Mathematical Sciences 161 6 (2009): 919-929. http://www.scopus.com/inward/record.url?eid=2-s2.0-70350330171&partnerID=MN8TOARS.
10.1007/s10958-009-9612-y
- Gouveia, L.; Magnanti, T.L.; Requejo, C.. "An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner
trees". Annals of Operations Research 146 1 (2006): 19-39. http://www.scopus.com/inward/record.url?eid=2-s2.0-33747878362&partnerID=MN8TOARS.
10.1007/s10479-006-0049-0
- Gouveia, L.; Magnanti, T.L.; Requejo, C.. "A 2-path approach for odd-diameter-constrained minimum spanning and steiner trees".
Networks 44 4 (2004): 254-265. http://www.scopus.com/inward/record.url?eid=2-s2.0-9744253800&partnerID=MN8TOARS.
10.1002/net.20034
- Gouveia, L.; Requejo, C.; Gouveia, Luís; Requejo, Cristina. "A new Lagrangean relaxation approach for the hop-constrained
minimum spanning tree problem". European Journal of Operational Research 132 3 (2001): 539-552. http://www.scopus.com/inward/record.url?eid=2-s2.0-0035427762&partnerID=MN8TOARS.
10.1016/S0377-2217(00)00143-0
- L. Fernandes; A. Fischer; J. Júdice; C. Requejo; J. Soares. "A block active set algorithm for large-scale quadratic programming
with box constraints". Annals of Operations Research 81 (1998): 75-96. http://dx.doi.org/10.1023/a:1018990014974.
10.1023/a:1018990014974
|
Capítulo de livro |
- Carroll, Paula; Requejo, Cristina. "Smart grid topology designs". OpenProceedings, 2019.
10.5441/002/inoc2019.10
- Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina. "Logistic operations in a hospital: a multi-item inventory distribution
problem with heterogeneous fleet". Springer, 2019.
10.1007/978-3-030-15398-4_16
- Requejo, Cristina; Santos, Eulália. "A feasibility pump and a local branching heuristics for the weight-constrained minimum
spanning tree problem". Springer International Publishing, 2017.
10.1007/978-3-319-62395-5_46
- Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina. "Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem".
In Machine Learning, Optimization, and Big Data, 236-245. Springer International Publishing, 2016.
10.1007/978-3-319-51469-7_20
- Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina. "A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution
Problem". In Machine Learning, Optimization, and Big Data, 144-158. Springer International Publishing, 2016.
10.1007/978-3-319-51469-7_12
- Costa, Mariana; Requejo, Cristina; Rodrigues, Filipe. "The Suppliers Selection Problem: A Case Study". In Operations Research
and Big Data, 175-184. Springer International Publishing, 2015.
10.1007/978-3-319-24154-8_21
- Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina; Santos, Eulália. "On the Weight-Constrained Minimum Spanning Tree
Problem". In Lecture Notes in Computer Science, 156-161. Springer Berlin Heidelberg, 2011.
10.1007/978-3-642-21527-8_20
- Requejo, C.; Agra, A.; Cerveira, A.; Santos, E.. "Formulations for the weight-constrained minimum spanning tree problem".
2166-2169. 2010.
10.1063/1.3498397
|