| A method for finding the set of non-dominated vectors for multiple objective integer linear programs J Sylva, A Crema European Journal of Operational Research 158 (1), 46-55, 2004 | 189 | 2004 |
| A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs J Sylva, A Crema European journal of operational research 180 (3), 1011-1027, 2007 | 91 | 2007 |
| Average shadow price in a mixed integer linear programming problem A Crema European Journal of Operational Research 85 (3), 625-635, 1995 | 35 | 1995 |
| The multiparametric 0–1-integer linear programming problem: A unified approach A Crema European Journal of Operational Research 139 (3), 511-520, 2002 | 25 | 2002 |
| An algorithm for the multiparametric 0–1-integer linear programming problem relative to the objective function A Crema European Journal of Operational Research 125 (1), 18-24, 2000 | 21 | 2000 |
| A contraction algorithm for the multiparametric integer linear programming problem A Crema European journal of operational research 101 (1), 130-139, 1997 | 21 | 1997 |
| Spectral projected subgradient with a momentum term for the Lagrangean dual approach A Crema, M Loreto, M Raydan Computers & operations research 34 (10), 3174-3186, 2007 | 18 | 2007 |
| Enumerating the set of non-dominated vectors in multiple objective integer linear programming J Sylva, A Crema RAIRO-Operations Research 42 (3), 371-387, 2008 | 16 | 2008 |
| An algorithm for the multiparametric 0–1-integer linear programming problem relative to the constraint matrix A Crema Operations Research Letters 27 (1), 13-19, 2000 | 11 | 2000 |
| An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem A Crema European journal of operational research 114 (3), 569-579, 1999 | 10 | 1999 |
| Min max min robust (relative) regret combinatorial optimization A Crema Mathematical Methods of Operations Research 92 (2), 249-283, 2020 | 9 | 2020 |
| A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem A Crema European journal of operational research 108 (3), 684-695, 1998 | 7 | 1998 |
| An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0–1-integer linear program A Crema European Journal of Operational Research 138 (3), 484-494, 2002 | 6 | 2002 |
| Convergence analysis for the modified spectral projected subgradient method M Loreto, A Crema Optimization Letters 9, 915-929, 2015 | 5 | 2015 |
| Generalized average shadow prices and bottlenecks A Crema Mathematical methods of Operations Research 88 (1), 99-124, 2018 | 2 | 2018 |
| Mathematical programming approach to tighten a Big-M formulation A Crema Escuela de Computacion, Facultad de Ciencias, Universidad Central de Venezuela 8, 2014 | 2 | 2014 |
| An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function JL Quintero, A Crema RAIRO-Operations Research 43 (1), 1-12, 2009 | 2 | 2009 |
| An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function JL Quintero, A Crema RAIRO-Operations Research-Recherche Opérationnelle 39 (4), 243-252, 2005 | 2 | 2005 |
| A parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems. A Crema Optimization online, Applications OR and Management Sciences. Escuela de …, 2016 | 1 | 2016 |
| Approximating the solution for the multiparametric 0-1-mixed integer linear programming problem with interval data A Crema, EH Peraza, F Crema Optimization Online (August, 2012), 2012 | 1 | 2012 |
Milagros LoretoUniversity of Washington BothellVerified email at uw.edu
