Cristina Requejo

According to our database, Cristina Requejo authored at least 32 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem.

Agostinho Agra, Cristina Requejo

EURO J. Comput. Optim., 2024

2022

MIP model-based heuristics for the minimum weighted tree reconstruction problem.

Olga Fajarda, Cristina Requejo

Oper. Res., 2022

Weighted iterated local branching for mathematical programming problems with binary variables.

Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo

J. Heuristics, 2022

2021

Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem.

Filipe Rodrigues, Agostinho Agra, Cristina Requejo, Erick Delage

INFORMS J. Comput., 2021

Weighted proximity search.

Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo

J. Heuristics, 2021

2020

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms.

Cristina Requejo, Eulália Santos

Oper. Res., 2020

Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques.

Paola Cappanera, Cristina Requejo, Maria Grazia Scutellà

Comput. Oper. Res., 2020

2019

Suppliers selection problem with quantity discounts and price changes: A heuristic approach.

Filipe Rodrigues, Cristina Requejo

RAIRO Oper. Res., 2019

Comparing techniques for modelling uncertainty in a maritime inventory routing problem.

Filipe Rodrigues, Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo

Eur. J. Oper. Res., 2019

A computational comparison of compact MILP formulations for the zero forcing number.

Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo

Discret. Appl. Math., 2019

Smart Grid Topology Designs.

Paula Carroll, Cristina Requejo

Proceedings of the 9th International Network Optimization Conference, 2019

2018

An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem.

Agostinho Agra, Cristina Requejo, Filipe Rodrigues

Networks, 2018

A hybrid heuristic for a stochastic production-inventory-routing problem.

Agostinho Agra, Cristina Requejo, Filipe Rodrigues

Electron. Notes Discret. Math., 2018

2017

Feasibility check for the distance geometry problem: an application to molecular conformations.

Agostinho Agra, Rosa Figueiredo, Carlile Lavor, Nelson Maculan, António Pereira, Cristina Requejo

Int. Trans. Oper. Res., 2017

Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem.

Bernard Fortz, Olga Oliveira, Cristina Requejo

Eur. J. Oper. Res., 2017

A decomposition approach for the p-median problem on disconnected graphs.

Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo

Comput. Oper. Res., 2017

A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem.

Cristina Requejo, Eulália Santos

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016

Implicit cover inequalities.

Agostinho Agra, Cristina Requejo, Eulália Santos

J. Comb. Optim., 2016

Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem.

Agostinho Agra, Adelaide Cerveira, Cristina Requejo

Proceedings of the Machine Learning, Optimization, and Big Data, 2016

A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem.

Agostinho Agra, Adelaide Cerveira, Cristina Requejo

Proceedings of the Machine Learning, Optimization, and Big Data, 2016

2013

Using decomposition to improve greedy solutions of the optimal diversity management problem.

Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo

Int. Trans. Oper. Res., 2013

The robust vehicle routing problem with time windows.

Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo

Comput. Oper. Res., 2013

2012

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.

Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks.

Rui Manuel Morais, Claunir Pavan, Armando Nolasco Pinto, Cristina Requejo

JOCN, 2011

Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.

J. Orestes Cerdeira, Rosa M. V. Figueiredo, António Pereira, Cristina Requejo

Int. J. Math. Model. Numer. Optimisation, 2011

On the Weight-Constrained Minimum Spanning Tree Problem.

Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos

Proceedings of the Network Optimization - 5th International Conference, 2011

2009

Extended formulations for the cardinality constrained subtree of a tree problem.

Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo

Oper. Res. Lett., 2009

2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.

Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo

Ann. Oper. Res., 2006

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem.

Geir Dahl, Luis Eduardo Neves Gouveia, Cristina Requejo

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2004

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.

Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo

Networks, 2004

2001

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem.

Luis Eduardo Neves Gouveia, Cristina Requejo

Eur. J. Oper. Res., 2001

1998

A block active set algorithm for large-scalequadratic programming with box constraints.

Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares

Ann. Oper. Res., 1998