Cristina Requejo - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2024

Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problemAgostinho Agra, Cristina Requejo. ejco, 12:100081, 2024. [doi]

2022

Weighted iterated local branching for mathematical programming problems with binary variablesFilipe Rodrigues 0002, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo. heuristics, 28(3):329-350, 2022. [doi]

MIP model-based heuristics for the minimum weighted tree reconstruction problemOlga Fajarda, Cristina Requejo. or, 22(3):2305-2342, 2022. [doi]

2021

Weighted proximity searchFilipe Rodrigues 0002, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo. heuristics, 27(3):459-496, 2021. [doi]

Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory ProblemFilipe Rodrigues 0002, Agostinho Agra, Cristina Requejo, Erick Delage. informs, 33(2):685-705, 2021. [doi]

2020

Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniquesPaola Cappanera, Cristina Requejo, Maria Grazia Scutellà. cor, 124:105054, 2020. [doi]

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithmsCristina Requejo, Eulália Santos. or, 20(4):2467-2495, 2020. [doi]

2019

2018

A hybrid heuristic for a stochastic production-inventory-routing problemAgostinho Agra, Cristina Requejo, Filipe Rodrigues. endm, 64:345-354, 2018. [doi]

An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problemAgostinho Agra, Cristina Requejo, Filipe Rodrigues. networks, 72(1):5-24, 2018. [doi]

2017

2016

2013

Using decomposition to improve greedy solutions of the optimal diversity management problemAgostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo. itor, 20(5):617-625, 2013. [doi]

The robust vehicle routing problem with time windowsAgostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo. cor, 40(3):856-866, 2013. [doi]

2012

Layered Formulation for the Robust Vehicle Routing Problem with Time WindowsAgostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo. iscopt 2012: 249-260 [doi]

2011

2009

Extended formulations for the cardinality constrained subtree of a tree problemA. Agra, Luis Gouveia, Cristina Requejo. orl, 37(3):192-196, 2009. [doi]

2006

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree ProblemGeir Dahl, Luís Gouveia, Cristina Requejo. In Mauricio G. C. Resende, Panos M. Pardalos, editors, Handbook of Optimization in Telecommunications. pages 493-515, Springer, 2006. [doi]

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner treesLuís Gouveia, Thomas L. Magnanti, Cristina Requejo. anor, 146(1):19-39, 2006. [doi]

2004

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner treesLuis Gouveia, Thomas L. Magnanti, Cristina Requejo. networks, 44(4):254-265, 2004. [doi]

2001

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problemLuis Gouveia, Cristina Requejo. eor, 132(3):539-552, 2001. [doi]

1998

A block active set algorithm for large-scalequadratic programming with box constraintsLuís M. Fernandes, Andreas Fischer 0004, Joaquim Júdice, Cristina Requejo, João Soares. anor, 81:75-96, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL

翻译：