Escudero Laureano F.

Laureano F. Escudero

Information about the author Laureano F. Escudero will soon be added to the site.
Found 18 papers in total
On a fix-and-relax framework for class of project scheduling problems
On a fix-and-relax framework for class of project scheduling problems
2005
We consider the following problem: Given a set of projects to be executed along a...
On identifying dominant cliques
On identifying dominant cliques
2003
In this paper we present two graph theory-based approaches for identifying dominant...
A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programs
A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programs
2003
We present a framework for solving some types of 0–1 multi-stage...
On dual based lower bounds for the sequential ordering problem with precedences and due dates
On dual based lower bounds for the sequential ordering problem with precedences and due dates
2003
The Sequential Ordering Problem (herewith, SOP) with precedence relationships was...
An O(n log n) procedure for identifying facets of the knapsack polytope
An O(n log n) procedure for identifying facets of the knapsack polytope
2003
An O(n log n) procedure is presented for obtaining facets of the knapsack polytope by...
0–1 equivalent model representations for air traffic management
0–1 equivalent model representations for air traffic management
1998
We present two equivalent representations of a 0–1 model for the Air Traffic...
On due-date based valid cuts for the sequential ordering problem
On due-date based valid cuts for the sequential ordering problem
1997
The Sequential Ordering Problem with precedence relationships was introduced in...
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
1999
In this short note we obtain the full set of inequalities that define the convex hull...
On surrogating 0–1 knapsack constraints
On surrogating 0–1 knapsack constraints
1999
In this note, we present a scheme for tightening 0–1 knapsack constraints based...
A parallel computation approach for solving multistage stochastic network problems
A parallel computation approach for solving multistage stochastic network problems
1999
This paper presents a parallel computation approach for the efficient solution of very...
A stochastic 0–1 program based approach for the air traffic flow management problem
A stochastic 0–1 program based approach for the air traffic flow management problem
2000
We present a model and a robust algorithmic framework for the Air Traffic Flow...
Schumann, a modeling framework for supply chain management under uncertainty
Schumann, a modeling framework for supply chain management under uncertainty
1999
We present a modeling framework for the optimization of a manufacturing, assembly and...
O(n log n) procedures for tightening cover inequalities
O(n log n) procedures for tightening cover inequalities
1999
We present two procedures for tightening cover induced inequalities in 0–1...
CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty
CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty
1999
We present a modeling framework for the optimization of a multiperiod Supply,...
On practical resource allocation for production planning and scheduling with period overlapping setups
On practical resource allocation for production planning and scheduling with period overlapping setups
1994
Capacity requirements planning is normally based on long-term demand forecasts and...
Production planning via scenario modelling
Production planning via scenario modelling
1993
Several Linear Programming (LP) and Mixed Integer Programing (MIP) models for the...
On modelling the maximum workload allocation for parallel unrelated machines with setups
On modelling the maximum workload allocation for parallel unrelated machines with setups
1993
Considering a manufacturing process in which a group of machines (or people) perform a...
New procedures for preprocessing 0-1 models with knapsack-like constraints and conjunctive and/or disjunctive variable upper bounds
New procedures for preprocessing 0-1 models with knapsack-like constraints and conjunctive and/or disjunctive variable upper bounds
1991
The authors present some preprocessing techniques for 0-1 models by taking advantage...
Papers per page: