Sciweavers

13376 search results - page 313 / 2676
» Problem Solving with
Sort
View
TASE
2008
IEEE
15 years 4 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
126
Voted
EVOW
2009
Springer
15 years 11 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
150
Voted
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 9 months ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
IOR
2006
93views more  IOR 2006»
15 years 4 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
IOR
2006
173views more  IOR 2006»
15 years 4 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau