default search action
Cristina Requejo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Agostinho Agra
, Cristina Requejo
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem. EURO J. Comput. Optim. 12: 100081 (2024) - 2022
- [j24]Filipe Rodrigues
Weighted iterated local branching for mathematical programming problems with binary variables. J. Heuristics 28(3): 329-350 (2022) - [j23]Olga Fajarda, Cristina Requejo
MIP model-based heuristics for the minimum weighted tree reconstruction problem. Oper. Res. 22(3): 2305-2342 (2022) - 2021
- [j22]Filipe Rodrigues
Weighted proximity search. J. Heuristics 27(3): 459-496 (2021) - [j21]Filipe Rodrigues
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem. INFORMS J. Comput. 33(2): 685-705 (2021) - 2020
- [j20]Paola Cappanera
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques. Comput. Oper. Res. 124: 105054 (2020) - [j19]Cristina Requejo
Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms. Oper. Res. 20(4): 2467-2495 (2020)
2010 – 2019
- 2019
- [j18]Agostinho Agra
A computational comparison of compact MILP formulations for the zero forcing number. Discret. Appl. Math. 269: 169-183 (2019) - [j17]Filipe Rodrigues
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Eur. J. Oper. Res. 277(3): 831-845 (2019) - [j16]Filipe Rodrigues
Suppliers selection problem with quantity discounts and price changes: A heuristic approach. RAIRO Oper. Res. 53(3): 887-901 (2019) - [c6]Paula Carroll, Cristina Requejo:
Smart Grid Topology Designs. INOC 2019: 49-53 - 2018
- [j15]Agostinho Agra
A hybrid heuristic for a stochastic production-inventory-routing problem. Electron. Notes Discret. Math. 64: 345-354 (2018) - [j14]Agostinho Agra
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Networks 72(1): 5-24 (2018) - 2017
- [j13]Agostinho Agra
A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86: 79-85 (2017) - [j12]Bernard Fortz
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. Eur. J. Oper. Res. 256(1): 242-251 (2017) - [j11]Agostinho Agra
Feasibility check for the distance geometry problem: an application to molecular conformations. Int. Trans. Oper. Res. 24(5): 1023-1040 (2017) - [c5]Cristina Requejo
A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem. ICCSA (2) 2017: 669-683 - 2016
- [j10]Agostinho Agra
Implicit cover inequalities. J. Comb. Optim. 31(3): 1111-1129 (2016) - [c4]Agostinho Agra
A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem. MOD 2016: 144-158 - [c3]Agostinho Agra
Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem. MOD 2016: 236-245 - 2013
- [j9]Agostinho Agra
The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3): 856-866 (2013) - [j8]Agostinho Agra
Using decomposition to improve greedy solutions of the optimal diversity management problem. Int. Trans. Oper. Res. 20(5): 617-625 (2013) - 2012
- [c2]Agostinho Agra
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO 2012: 249-260 - 2011
- [j7]J. Orestes Cerdeira
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry. Int. J. Math. Model. Numer. Optimisation 2(3): 273-287 (2011) - [j6]Rui Manuel Morais
Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks. JOCN 3(1): 17-26 (2011) - [c1]Agostinho Agra
On the Weight-Constrained Minimum Spanning Tree Problem. INOC 2011: 156-161
2000 – 2009
- 2009
- [j5]Agostinho Agra
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37(3): 192-196 (2009) - 2006
- [j4]Luis Eduardo Neves Gouveia
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Ann. Oper. Res. 146(1): 19-39 (2006) - [p1]Geir Dahl, Luis Eduardo Neves Gouveia, Cristina Requejo:
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. Handbook of Optimization in Telecommunications 2006: 493-515 - 2004
- [j3]Luis Eduardo Neves Gouveia
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44(4): 254-265 (2004) - 2001
- [j2]Luis Eduardo Neves Gouveia
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132(3): 539-552 (2001)
1990 – 1999
- 1998
- [j1]Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares:
A block active set algorithm for large-scalequadratic programming with box constraints. Ann. Oper. Res. 81: 75-96 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: