LAUREANO FERNANDO
ESCUDERO BUENO
Investigador hasta 2008
Universidad Miguel Hernández de Elche
Elche, EspañaPublicaciones en colaboración con investigadores/as de Universidad Miguel Hernández de Elche (15)
2009
-
A branch-and-cut algorithm for the Winner Determination Problem
Decision Support Systems, Vol. 46, Núm. 3, pp. 649-659
-
On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
Computational Management Science, Vol. 6, Núm. 3, pp. 307-327
-
On stochastic dynamic programming for solving large-scale planning problems under uncertainty
Computers and Operations Research, Vol. 36, Núm. 8, pp. 2418-2428
2008
-
A model for risk minimisation on water resource usage failure
International Journal of Risk Assessment and Management, Vol. 10, Núm. 4, pp. 386-403
-
A rules reduction algorithm based on significance measure
WIT Transactions on Information and Communication Technologies
-
Computer application for optimization of turn assignment on a tree-structured irrigation network
WIT Transactions on Ecology and the Environment, Vol. 112, pp. 255-262
2007
-
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes
Annals of Operations Research, Vol. 152, Núm. 1, pp. 395-420
-
On a stochastic sequencing and scheduling problem
Computers and Operations Research, Vol. 34, Núm. 9, pp. 2604-2624
2006
-
On solving the multi-period single-sourcing problem under uncertainty
Computational Management Science, Vol. 3, Núm. 1, pp. 29-53
2005
-
On the product selection and plant dimensioning problem under uncertainty
Omega, Vol. 33, Núm. 4, pp. 307-318
2003
-
An O(n log n) procedure for identifying facets of the knapsack polytope
Operations Research Letters, Vol. 31, Núm. 3, pp. 211-218
-
An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
Journal of Global Optimization, Vol. 26, Núm. 1, pp. 97-124
-
BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs
European Journal of Operational Research, Vol. 151, Núm. 3, pp. 503-519
-
On dual based lower bounds for the sequential ordering problem with precedences and due dates
Annals of Operations Research, Vol. 124, Núm. 1-4, pp. 111-131
-
On identifying dominant cliques
European Journal of Operational Research, Vol. 149, Núm. 1, pp. 65-76