The robust vehicle routing problem with time windows. Zbl 1349.90152
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; Poss, Michael; Requejo, Cristina |
|
2013
|
On formulations and methods for the hop-constrained minimum spanning tree problem. Zbl 1118.90051
Dahl, Geir; Gouveia, Luis; Requejo, Cristina |
|
2006
|
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Zbl 1055.90084
Gouveia, Luís; Requejo, Cristina |
|
2001
|
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1058.90069
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina |
|
2004
|
Layered formulation for the robust vehicle routing problem with time windows. Zbl 1370.90019
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Magnus Hvattum, Lars; Poss, Michael; Requejo, Cristina |
|
2012
|
A block active set algorithm for large-scale quadratic programming with box constraints. Zbl 0906.90138
Fernandes, L.; Fischer, A.; Júdice, J.; Requejo, C.; Soares, J. |
|
1998
|
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Zbl 1430.90127
Rodrigues, Filipe; Agra, Agostinho; Christiansen, Marielle; Hvattum, Lars Magnus; Requejo, Cristina |
|
2019
|
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1107.90007
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina |
|
2006
|
The linking set problem: a polynomial special case of the multiple-choice knapsack problem. Zbl 1192.90152
Agra, A.; Requejo, C. |
|
2009
|
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Zbl 1397.90048
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe |
|
2018
|
Feasibility check for the distance geometry problem: an application to molecular conformations. Zbl 1371.90086
Agra, Agostinho; Figueiredo, Rosa; Lavor, Carlile; Maculan, Nelson; Pereira, António; Requejo, Cristina |
|
2017
|
A hybrid heuristic for a stochastic production-inventory-routing problem. Zbl 1392.90004
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe |
|
2018
|
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. Zbl 1394.90435
Fortz, Bernard; Oliveira, Olga; Requejo, Cristina |
|
2017
|
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem. Zbl 07362341
Rodrigues, Filipe; Agra, Agostinho; Requejo, Cristina; Delage, Erick |
|
2021
|
Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques. Zbl 1458.90272
Cappanera, Paola; Requejo, Cristina; Scutellà, Maria Grazia |
|
2020
|
Using decomposition to improve greedy solutions of the optimal diversity management problem. Zbl 1276.90036
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2013
|
On the weight-constrained minimum spanning tree problem. Zbl 1345.90088
Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina; Santos, Eulália |
|
2011
|
Greedy heuristics for the diameter-constrained minimum spanning tree problem. Zbl 1192.90183
Requejo, C.; Santos, E. |
|
2009
|
A computational comparison of compact MILP formulations for the zero forcing number. Zbl 1421.05039
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2019
|
Extended formulations for the cardinality constrained subtree of a tree problem. Zbl 1167.90659
Agra, A.; Gouveia, L.; Requejo, C. |
|
2009
|
A decomposition approach for the \(p\)-median problem on disconnected graphs. Zbl 1391.90364
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2017
|
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem. Zbl 07362341
Rodrigues, Filipe; Agra, Agostinho; Requejo, Cristina; Delage, Erick |
|
2021
|
Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques. Zbl 1458.90272
Cappanera, Paola; Requejo, Cristina; Scutellà, Maria Grazia |
|
2020
|
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Zbl 1430.90127
Rodrigues, Filipe; Agra, Agostinho; Christiansen, Marielle; Hvattum, Lars Magnus; Requejo, Cristina |
|
2019
|
A computational comparison of compact MILP formulations for the zero forcing number. Zbl 1421.05039
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2019
|
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Zbl 1397.90048
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe |
|
2018
|
A hybrid heuristic for a stochastic production-inventory-routing problem. Zbl 1392.90004
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe |
|
2018
|
Feasibility check for the distance geometry problem: an application to molecular conformations. Zbl 1371.90086
Agra, Agostinho; Figueiredo, Rosa; Lavor, Carlile; Maculan, Nelson; Pereira, António; Requejo, Cristina |
|
2017
|
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. Zbl 1394.90435
Fortz, Bernard; Oliveira, Olga; Requejo, Cristina |
|
2017
|
A decomposition approach for the \(p\)-median problem on disconnected graphs. Zbl 1391.90364
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2017
|
The robust vehicle routing problem with time windows. Zbl 1349.90152
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; Poss, Michael; Requejo, Cristina |
|
2013
|
Using decomposition to improve greedy solutions of the optimal diversity management problem. Zbl 1276.90036
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina |
|
2013
|
Layered formulation for the robust vehicle routing problem with time windows. Zbl 1370.90019
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Magnus Hvattum, Lars; Poss, Michael; Requejo, Cristina |
|
2012
|
On the weight-constrained minimum spanning tree problem. Zbl 1345.90088
Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina; Santos, Eulália |
|
2011
|
The linking set problem: a polynomial special case of the multiple-choice knapsack problem. Zbl 1192.90152
Agra, A.; Requejo, C. |
|
2009
|
Greedy heuristics for the diameter-constrained minimum spanning tree problem. Zbl 1192.90183
Requejo, C.; Santos, E. |
|
2009
|
Extended formulations for the cardinality constrained subtree of a tree problem. Zbl 1167.90659
Agra, A.; Gouveia, L.; Requejo, C. |
|
2009
|
On formulations and methods for the hop-constrained minimum spanning tree problem. Zbl 1118.90051
Dahl, Geir; Gouveia, Luis; Requejo, Cristina |
|
2006
|
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1107.90007
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina |
|
2006
|
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1058.90069
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina |
|
2004
|
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Zbl 1055.90084
Gouveia, Luís; Requejo, Cristina |
|
2001
|
A block active set algorithm for large-scale quadratic programming with box constraints. Zbl 0906.90138
Fernandes, L.; Fischer, A.; Júdice, J.; Requejo, C.; Soares, J. |
|
1998
|
