All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 74 Next

Displaying 1461 – 1480 of 2805

Showing per page

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan (2011)

RAIRO - Operations Research

Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan (2011)

RAIRO - Operations Research

Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...

MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

Nabil Absi, Safia Kedad-Sidhoum (2007)

RAIRO - Operations Research

We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons over...

Mixed complementarity problems for robust optimization equilibrium in bimatrix game

Guimei Luo (2012)

Applications of Mathematics

In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent’s strategies nor evaluate his own cost matrix accurately while he may estimate a bounded uncertain set. We obtain computationally tractable robust formulations which turn to be linear programming problems and then solving a robust optimization equilibrium can be converted to solving a mixed complementarity problem under the l 1 ∩ l ∞ -norm. Some numerical...

Modèles Analytiques de Routeurs

Emmanuel Besson (2010)

RAIRO - Operations Research

We focus on performance study of routers in high-speed network through a queuing network analytical model. Such a model gives accurate results about classical performance criteria. For example, analytical study of packet loss probabilities in a router uses a product-form queuing network. The analytical results are compared to simulation results, and they provide routers managers with invaluable information for internal memories tuning.

Modelización de un DSS para la gestión de productos perecederos.

Belarmino Díaz Fernández, Jesús Angel del Brío González, B. González Torre (2001)

Qüestiió

La gestión de inventarios de productos perecederos ha atraído desde hace tiempo la atención de los investigadores de Dirección de Operaciones. En este artículo se presenta la modelización e implementación de un sistema de apoyo a la toma de decisiones (DSS) para la gestión de productos perecederos, aplicado a la distribución interhospitalaria de hemoderivados. En estos casos se trata de satisfacer en lo posible las demandas, tratando de evitar a la vez la caducidad de los productos en manos de los...

Modelling integer linear programs with petri nets*

P. Richard (2010)

RAIRO - Operations Research

We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions. ...

Currently displaying 1461 – 1480 of 2805