Search
Now showing items 1-10 of 14
A note on Lopez-Hernandez procedure: New non-hierarchical algorithms in classification of data
(2000-03)
[EN] In this short note, we make a critique about the procedure developed in the Inductive Algorithm in the Objects of Lopez-Hernandez (1997). It is well known that the determination of maximal cliques in a graph is an ...
Motivación de los estudiantes de LE y LADE ante el estudio de la Estadística
(2004)
El objetivo fundamental de este trabajo es analizar las motivaciones dominantes en los alumnos de las Licenciaturas de Economía (LE) y Administración y Dirección de Empresas (LADE)a la hora de enfrentarse a las asignaturas ...
Scenario Cluster Lagrangian Decomposition in two stage stochastic mixed 0-1 optimization
(2012)
In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the
(optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration ...
Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems
(2010-07)
In this paper we study solution methods for solving the dual problem corresponding to the Lagrangean Decomposition of two stage stochastic mixed 0-1 models. We represent the two stage stochastic mixed 0-1 problem by a ...
A two-stage stochastic integer programming approach
(2005)
We present an algorithmic approach for solving two-stage stochastic mixed 0-1 problems. The first stage constraints of the Deterministic Equivalent Model have 0--1 variables and continuous variables. The approach uses the ...
Some experiments on solving multistage stochastic mixed 0-1 programs with time stochastic dominance constraints
(2015)
In this work we extend to the multistage case two recent risk averse measures for two-stage stochastic
programs based on first- and second-order stochastic dominance constraints induced by mixed-integer linear
recourse. ...
On downloading and using COIN-OR for solving linear/integer optimization problems
(2010)
The aim of this technical report is to present some detailed explanations in order to help to use the open source software for optimization COIN-OR. In particular, we describe how to download, install and use the corresponding ...
A note on the implementation of the BFC-MSMIP algorithm in C++ by using COIN-OR as an optimization engine
(2010)
The aim of this technical report is to present some detailed explanations in order to help to understand and use the algorithm Branch and Fix Coordination for solving MultiStage Mixed Integer Problems (BFC- MSMIP). We have ...
MPI parallel programming of mixed integer optimization problems using CPLEX with COIN-OR
(2012)
The aim of this technical report is to present some detailed explanations in order to help
to understand and use the Message Passing Interface (MPI) parallel programming for solving
several mixed integer optimization ...
A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty
(2011-02)
In this paper we present a parallelizable scheme of the Branch-and-Fix Coordination algorithm for solving medium and large scale multi-stage mixed 0-1 optimization problems under uncertainty. The uncertainty is represented ...