Sciweavers

14548 search results - page 315 / 2910
» The Optimal Path-Matching Problem
Sort
View
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 7 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
HM
2010
Springer
157views Optimization» more  HM 2010»
15 years 7 months ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
EOR
2007
87views more  EOR 2007»
15 years 6 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
EOR
2007
70views more  EOR 2007»
15 years 6 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
WWW
2008
ACM
16 years 7 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy