The following pages link to Cristina Requejo (Q194430):
Displaying 24 items.
- Implicit cover inequalities (Q266036) (← links)
- The robust vehicle routing problem with time windows (Q340242) (← links)
- (Q833577) (redirect page) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- A block active set algorithm for large-scale quadratic programming with box constraints (Q1265874) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- Comparing techniques for modelling uncertainty in a maritime inventory routing problem (Q1740492) (← links)
- A hybrid heuristic for a stochastic production-inventory-routing problem (Q1742254) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques (Q2664406) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
- On the Weight-Constrained Minimum Spanning Tree Problem (Q3091497) (← links)
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees (Q3157034) (← links)
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows (Q3167629) (← links)
- An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem (Q4687210) (← links)
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
- Suppliers selection problem with quantity discounts and price changes: A heuristic approach (Q5242272) (← links)
- (Q5294063) (← links)
- Feasibility check for the distance geometry problem: an application to molecular conformations (Q5364068) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
