Cristina Requejo

Available identifiers

zbMath Open requejo.cristinaWikidataQ57446563 ScholiaQ57446563MaRDI QIDQ194430

List of research outcomes

Publication	Date of Publication	Type
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem	2021-06-23	Paper
Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques	2021-04-20	Paper
Suppliers selection problem with quantity discounts and price changes: A heuristic approach	2019-11-06	Paper
A computational comparison of compact MILP formulations for the zero forcing number	2019-10-09	Paper
Comparing techniques for modelling uncertainty in a maritime inventory routing problem	2019-04-30	Paper
An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem	2018-10-11	Paper
A decomposition approach for the \(p\)-median problem on disconnected graphs	2018-07-11	Paper
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem	2018-05-24	Paper
A hybrid heuristic for a stochastic production-inventory-routing problem	2018-04-11	Paper
Feasibility check for the distance geometry problem: an application to molecular conformations	2017-10-02	Paper
The robust vehicle routing problem with time windows	2016-11-14	Paper
Implicit cover inequalities	2016-04-13	Paper
Using decomposition to improve greedy solutions of the optimal diversity management problem	2013-11-14	Paper
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows	2012-11-02	Paper
On the Weight-Constrained Minimum Spanning Tree Problem	2011-09-09	Paper
Greedy heuristics for the diameter-constrained minimum spanning tree problem	2010-01-19	Paper
The linking set problem: a polynomial special case of the multiple-choice knapsack problem	2010-01-19	Paper
Extended formulations for the cardinality constrained subtree of a tree problem	2009-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q5294063	2007-07-23	Paper
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees	2007-02-05	Paper
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees	2005-01-12	Paper
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem	2001-01-01	Paper
A block active set algorithm for large-scale quadratic programming with box constraints	1998-09-27	Paper

Research outcomes over time

This page was built for person: Cristina Requejo