Escudero L.F.

L.F. Escudero

Information about the author L.F. Escudero will soon be added to the site.
Found 20 papers in total
On a stochastic sequencing and scheduling problem
On a stochastic sequencing and scheduling problem
2007
We present a framework for solving multistage pure 0–1 programs for a widely...
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes
2007
We present an algorithmic approach for solving two-stage stochastic mixed 0–1...
On the product selection and plant dimensioning problem under uncertainty
On the product selection and plant dimensioning problem under uncertainty
2005
We present a two-stage full recourse model for strategic production planning under...
On solving the multi-period single-sourcing problem under uncertainty
On solving the multi-period single-sourcing problem under uncertainty
2006
We present a framework for solving the strategic problem of assigning retailers to...
On characterizing maximal covers
On characterizing maximal covers
2002
In this paper we introduce the concept of maximal covers and provide some...
WARSYP: A robust modeling approach for water resources system planning under uncertainty
WARSYP: A robust modeling approach for water resources system planning under uncertainty
2000
In this work we present a solution procedure for multiperiod water resources system...
On characterizing tighter formulations for 0–1 programs
On characterizing tighter formulations for 0–1 programs
1998
We present two approaches for 0–1 program model tightening. They are based on...
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
On tightening 0–1 programs based on extensions of pure 0–1 knapsack and subset-sum problems
1998
We present a framework for automatic tightening of general 0–1 programs. A given...
On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective function
On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective function
1994
In this brief note the authors demonstrate that the Dietrich-Escudero procedure for...
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
1994
The authors show how clique and cover induced inequalities implied from 0-1 knapsack...
On tightening cover induced inequalities
On tightening cover induced inequalities
1992
Here the authors describe computationally efficient procedures for tightening cover...
CMIT, capacitated multi-level implosion tool
CMIT, capacitated multi-level implosion tool
1994
The paper presents an LP model for resource deployment decisions in a multi-product,...
A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships
A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships
1994
The sequential ordering problem with precedence relationships was introduced by...
Efficient reformulation for 0-1 programs-Methods and computational results
Efficient reformulation for 0-1 programs-Methods and computational results
1993
The authors introduce two general methods for 0-1 program reformulation. The present...
Local search procedures for improving feasible solutions to the Sequential Ordering Problem
Local search procedures for improving feasible solutions to the Sequential Ordering Problem
1993
Given a digraph G=(V,A), a weight for each node in V and a weight for each arc in A,...
On solving a nondifferentiable nonlinear transshipment problem
On solving a nondifferentiable nonlinear transshipment problem
1990
The paper presents a new type of transshipment problem with a nonseparable nonlinear...
Strategies for LP-based solving a general class of scheduling problems
Strategies for LP-based solving a general class of scheduling problems
1990
In this work the authors describe some strategies that have been proved to be very...
An inexact algorithm for part input sequencing and scheduling with side constraints in FMS
An inexact algorithm for part input sequencing and scheduling with side constraints in FMS
1989
Consider a flexible manufacturing system that produces parts of several types. The FMS...
Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
1990
The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by...
A production planning problem in FMS
A production planning problem in FMS
1989
This work presents a hierarchical approach for generating alternatives for production...
Papers per page: