Sciweavers

1547 search results - page 5 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 7 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
COR
2007
108views more  COR 2007»
13 years 7 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
ICTAI
2007
IEEE
14 years 1 months ago
Ant Colony Optimization for Multi-Objective Optimization Problems
We propose in this paper a generic algorithm based on Ant Colony Optimization to solve multi-objective optimization problems. The proposed algorithm is parameterized by the number...
Inès Alaya, Christine Solnon, Khaled Gh&eac...
CEC
2005
IEEE
14 years 1 months ago
A hybrid model of evolutionary algorithms and branch-and-bound for combinatorial optimization problems
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
José E. Gallardo, Carlos Cotta, Antonio J. ...
IOR
2006
93views more  IOR 2006»
13 years 7 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini