Sciweavers

14739 search results - page 166 / 2948
» An optimization problem on the sphere
Sort
View
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 2 months ago
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
Zizhuo Wang, Shiming Deng, Yinyu Ye
IWANN
2005
Springer
15 years 4 months ago
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
Carlos Cotta
SAC
1996
ACM
15 years 2 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
13 years 6 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
AUSSOIS
2001
Springer
15 years 3 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger