Rodrigues, Filipe; Agra, Agostinho; Requejo, Cristina; Delage, Erick Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem. (English) Zbl 07362341 INFORMS J. Comput. 33, No. 2, 685-705 (2021). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI Link
Cappanera, Paola; Requejo, Cristina; Scutellà, Maria Grazia Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques. (English) Zbl 1458.90272 Comput. Oper. Res. 124, Article ID 105054, 20 p. (2020). MSC: 90B35 90B06 90C11 90C59 × Cite Format Result Cite Review PDF Full Text: DOI Link
Rodrigues, Filipe; Requejo, Cristina Suppliers selection problem with quantity discounts and price changes: A heuristic approach. (English) Zbl 1423.90122 RAIRO, Oper. Res. 53, No. 3, 887-901 (2019). MSC: 90B50 90C11 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina A computational comparison of compact MILP formulations for the zero forcing number. (English) Zbl 1421.05039 Discrete Appl. Math. 269, 169-183 (2019). MSC: 05C15 90C05 90C10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Rodrigues, Filipe; Agra, Agostinho; Christiansen, Marielle; Hvattum, Lars Magnus; Requejo, Cristina Comparing techniques for modelling uncertainty in a maritime inventory routing problem. (English) Zbl 1430.90127 Eur. J. Oper. Res. 277, No. 3, 831-845 (2019). MSC: 90B06 90B05 90C15 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. (English) Zbl 1397.90048 Networks 72, No. 1, 5-24 (2018). MSC: 90B06 90B05 90C59 90C15 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Requejo, Cristina; Rodrigues, Filipe A hybrid heuristic for a stochastic production-inventory-routing problem. (English) Zbl 1392.90004 Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 345-354 (2018). MSC: 90B05 90C59 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina A decomposition approach for the \(p\)-median problem on disconnected graphs. (English) Zbl 1391.90364 Comput. Oper. Res. 86, 79-85 (2017). MSC: 90B80 90C35 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Fortz, Bernard; Oliveira, Olga; Requejo, Cristina Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. (English) Zbl 1394.90435 Eur. J. Oper. Res. 256, No. 1, 242-251 (2017). MSC: 90C11 90C35 05C05 05C50 90B10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Figueiredo, Rosa; Lavor, Carlile; Maculan, Nelson; Pereira, António; Requejo, Cristina Feasibility check for the distance geometry problem: an application to molecular conformations. (English) Zbl 1371.90086 Int. Trans. Oper. Res. 24, No. 5, 1023-1040 (2017). MSC: 90C10 90C90 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Agra, Agostinho; Requejo, Cristina; Santos, Eulália Implicit cover inequalities. (English) Zbl 1364.90283 J. Comb. Optim. 31, No. 3, 1111-1129 (2016). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Hvattum, Lars Magnus; Poss, Michael; Requejo, Cristina The robust vehicle routing problem with time windows. (English) Zbl 1349.90152 Comput. Oper. Res. 40, No. 3, 856-866 (2013). MSC: 90B10 90C10 90C39 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina Using decomposition to improve greedy solutions of the optimal diversity management problem. (English) Zbl 1276.90036 Int. Trans. Oper. Res. 20, No. 5, 617-625 (2013). MSC: 90B80 90C10 90C59 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
Agra, Agostinho; Christiansen, Marielle; Figueiredo, Rosa; Magnus Hvattum, Lars; Poss, Michael; Requejo, Cristina Layered formulation for the robust vehicle routing problem with time windows. (English) Zbl 1370.90019 Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 249-260 (2012). MSC: 90B06 90B10 90C10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Agra, Agostinho; Cerveira, Adelaide; Requejo, Cristina; Santos, Eulália On the weight-constrained minimum spanning tree problem. (English) Zbl 1345.90088 Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 156-161 (2011). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Requejo, C.; Santos, E. Greedy heuristics for the diameter-constrained minimum spanning tree problem. (English. Russian original) Zbl 1192.90183 J. Math. Sci., New York 161, No. 6, 930-943 (2009); translation from Sovrem. Mat. Prilozh. 63 (2009). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Agra, A.; Requejo, C. The linking set problem: a polynomial special case of the multiple-choice knapsack problem. (English. Russian original) Zbl 1192.90152 J. Math. Sci., New York 161, No. 6, 919-929 (2009); translation from Sovrem. Mat. Prilozh. 63 (2009). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Agra, A.; Gouveia, L.; Requejo, C. Extended formulations for the cardinality constrained subtree of a tree problem. (English) Zbl 1167.90659 Oper. Res. Lett. 37, No. 3, 192-196 (2009). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Dahl, Geir; Gouveia, Luis; Requejo, Cristina On formulations and methods for the hop-constrained minimum spanning tree problem. (English) Zbl 1118.90051 Resende, Mauricio G. C. (ed.) et al., Handbook of optimization in telecommunications. New York, NY: Springer (ISBN 0-387-30662-5/hbk). 493-515 (2006). MSC: 90C35 × Cite Format Result Cite Review PDF
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. (English) Zbl 1107.90007 Ann. Oper. Res. 146, 19-39 (2006). MSC: 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. (English) Zbl 1058.90069 Networks 44, No. 4, 254-265 (2004). MSC: 90C35 05C38 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Gouveia, Luís; Requejo, Cristina A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. (English) Zbl 1055.90084 Eur. J. Oper. Res. 132, No. 3, 539-552 (2001). MSC: 90C35 90C57 × Cite Format Result Cite Review PDF Full Text: DOI
Fernandes, L.; Fischer, A.; Júdice, J.; Requejo, C.; Soares, J. A block active set algorithm for large-scale quadratic programming with box constraints. (English) Zbl 0906.90138 Ann. Oper. Res. 81, 75-95 (1998). MSC: 90C20 90C06 × Cite Format Result Cite Review PDF Full Text: DOI