 | 2012 |
|---|
| 8 |       | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees.
Computers & OR 39(5): 1133-1144 (2012) |
| 7 | | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees.
Computers & OR 39(9): 2266 (2012) |
| 2010 |
|---|
| 6 | | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming.
Computers & OR 37(4): 738-753 (2010) |
| 5 | | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects.
European Journal of Operational Research 204(1): 105-116 (2010) |
| 2009 |
|---|
| 4 | | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems.
Computers & OR 36(9): 2590-2600 (2009) |
| 2007 |
|---|
| 3 | | Laureano F. Escudero,
María Araceli Garín,
María Merino,
Gloria Pérez:
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes.
Annals OR 152(1): 395-420 (2007) |
| 2003 |
|---|
| 2 | | Laureano F. Escudero,
María Araceli Garín,
Gloria Pérez:
An O(n log n) procedure for identifying facets of the knapsack polytope.
Oper. Res. Lett. 31(3): 211-218 (2003) |
| 1999 |
|---|
| 1 | | Laureano F. Escudero,
María Araceli Garín,
Gloria Pérez:
O(n log n) procedures for tightening cover inequalities.
European Journal of Operational Research 113(3): 676-687 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page