María Araceli Garín

Orcid: 0000-0002-1724-5499

According to our database1, María Araceli Garín authored at least 20 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On solving the cross-dock door assignment problem.
Int. J. Prod. Res., February, 2024

2021
Analytics and Optimization Techniques on Feeder Identification in Smart Grids.
Proceedings of the 19th IEEE International Conference on Smart Technologies, 2021

2020
Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management.
Eur. J. Oper. Res., 2020

2018
On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management.
Comput. Oper. Res., 2018

On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems.
Comput. Optim. Appl., 2018

2017
Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization.
Comput. Oper. Res., 2017

2016
On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs.
Eur. J. Oper. Res., 2016

Cluster Lagrangean decomposition in multistage stochastic optimization.
Comput. Oper. Res., 2016

2013
Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization.
Comput. Oper. Res., 2013

2012
An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees.
Comput. Oper. Res., 2012

2011
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Enhancing Statistics Teaching with a Virtual Lab - A Case Study of Seamless Local and Remote Computing.
Proceedings of the CSEDU 2011, 2011

2010
An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects.
Eur. J. Oper. Res., 2010

On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming.
Comput. Oper. Res., 2010

2009
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems.
Comput. Oper. Res., 2009

On multistage Stochastic Integer Programming for incorporating logical constraints in asset and liability management under uncertainty.
Comput. Manag. Sci., 2009

2007
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes.
Ann. Oper. Res., 2007

2003
An O(n log n) procedure for identifying facets of the knapsack polytope.
Oper. Res. Lett., 2003

An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming.
J. Glob. Optim., 2003

1999
O(n log n) procedures for tightening cover inequalities.
Eur. J. Oper. Res., 1999


  Loading...