Cristina Requejo

Orcid: 0000-0003-0529-5090

According to our database1, Cristina Requejo authored at least 31 papers between 1998 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
MIP model-based heuristics for the minimum weighted tree reconstruction problem.
Oper. Res., 2022

Weighted iterated local branching for mathematical programming problems with binary variables.
J. Heuristics, 2022

2021
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem.
INFORMS J. Comput., 2021

Weighted proximity search.
J. Heuristics, 2021

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

Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques.
Comput. Oper. Res., 2020

2019
Suppliers selection problem with quantity discounts and price changes: A heuristic approach.
RAIRO Oper. Res., 2019

Comparing techniques for modelling uncertainty in a maritime inventory routing problem.
Eur. J. Oper. Res., 2019

A computational comparison of compact MILP formulations for the zero forcing number.
Discret. Appl. Math., 2019

Smart Grid Topology Designs.
Proceedings of the 9th International Network Optimization Conference, 2019

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

A hybrid heuristic for a stochastic production-inventory-routing problem.
Electron. Notes Discret. Math., 2018

2017
Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res., 2017

Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem.
Eur. J. Oper. Res., 2017

A decomposition approach for the p-median problem on disconnected graphs.
Comput. Oper. Res., 2017

A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Implicit cover inequalities.
J. Comb. Optim., 2016

Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

2013
Using decomposition to improve greedy solutions of the optimal diversity management problem.
Int. Trans. Oper. Res., 2013

The robust vehicle routing problem with time windows.
Comput. Oper. Res., 2013

2012
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

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

Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.
Int. J. Math. Model. Numer. Optimisation, 2011

On the Weight-Constrained Minimum Spanning Tree Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2009
Extended formulations for the cardinality constrained subtree of a tree problem.
Oper. Res. Lett., 2009

2006
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
Ann. Oper. Res., 2006

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

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

2001
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem.
Eur. J. Oper. Res., 2001

1998
A block active set algorithm for large-scalequadratic programming with box constraints.
Ann. Oper. Res., 1998


  Loading...