Cristina Requejo

32 papers C 3Journal 25Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem.
EURO J. Comput. Optim.
Agostinho Agra, Cristina Requejo
2022 J jnl
MIP model-based heuristics for the minimum weighted tree reconstruction problem.
Oper. Res.
Olga Fajarda, Cristina Requejo
2022 J jnl
Weighted iterated local branching for mathematical programming problems with binary variables.
J. Heuristics
Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo
2021 J jnl
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem.
INFORMS J. Comput.
Filipe Rodrigues, Agostinho Agra, Cristina Requejo, Erick Delage
2021 J jnl
Weighted proximity search.
J. Heuristics
Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo
2020 J jnl
Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms.
Oper. Res.
Cristina Requejo, Eulália Maria Santos
2020 J jnl
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques.
Comput. Oper. Res.
Paola Cappanera, Cristina Requejo, Maria Grazia Scutellà
2019 J jnl
A computational comparison of compact MILP formulations for the zero forcing number.
Discret. Appl. Math.
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
2019 J jnl
Comparing techniques for modelling uncertainty in a maritime inventory routing problem.
Eur. J. Oper. Res.
Filipe Rodrigues, Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo
2019 C conf
Smart Grid Topology Designs.
INOC
Paula Carroll, Cristina Requejo
2019 J jnl
Suppliers selection problem with quantity discounts and price changes: A heuristic approach.
RAIRO Oper. Res.
Filipe Rodrigues, Cristina Requejo
2018 J jnl
A hybrid heuristic for a stochastic production-inventory-routing problem.
Electron. Notes Discret. Math.
Agostinho Agra, Cristina Requejo, Filipe Rodrigues
2018 J jnl
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem.
Networks
Agostinho Agra, Cristina Requejo, Filipe Rodrigues
2017 — conf
A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem.
ICCSA (2)
Cristina Requejo, Eulália Maria Santos
2017 J jnl
A decomposition approach for the p-median problem on disconnected graphs.
Comput. Oper. Res.
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
2017 J jnl
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem.
Eur. J. Oper. Res.
Bernard Fortz, Olga Oliveira, Cristina Requejo
2017 J jnl
Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res.
Agostinho Agra, Rosa Figueiredo, Carlile Lavor, Nelson Maculan, António Pereira, Cristina Requejo
2016 — conf
A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem.
MOD
Agostinho Agra, Adelaide Cerveira, Cristina Requejo
2016 J jnl
Implicit cover inequalities.
J. Comb. Optim.
Agostinho Agra, Cristina Requejo, Eulália Maria Santos
2016 — conf
Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem.
MOD
Agostinho Agra, Adelaide Cerveira, Cristina Requejo
2013 J jnl
The robust vehicle routing problem with time windows.
Comput. Oper. Res.
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
2013 J jnl
Using decomposition to improve greedy solutions of the optimal diversity management problem.
Int. Trans. Oper. Res.
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
2012 C conf
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.
ISCO
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
2011 J jnl
Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks.
JOCN
Rui Manuel Morais, Claunir Pavan, Armando Nolasco Pinto, Cristina Requejo
2011 C conf
On the Weight-Constrained Minimum Spanning Tree Problem.
INOC
Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Maria Santos
2011 J jnl
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.
Int. J. Math. Model. Numer. Optimisation
J. Orestes Cerdeira, Rosa M. V. Figueiredo, António Pereira, Cristina Requejo
2009 J jnl
Extended formulations for the cardinality constrained subtree of a tree problem.
Oper. Res. Lett.
Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo
2006 J jnl
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
Ann. Oper. Res.
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
2006 — ch.
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem.
Handbook of Optimization in Telecommunications
Geir Dahl, Luis Eduardo Neves Gouveia, Cristina Requejo
2004 J jnl
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
Networks
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
2001 J jnl
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem.
Eur. J. Oper. Res.
Luis Eduardo Neves Gouveia, Cristina Requejo
1998 J jnl
A block active set algorithm for large-scalequadratic programming with box constraints.
Ann. Oper. Res.
Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares