14548 search results - page 346 / 2910 » The Optimal Path-Matching Problem |
172
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
152
click to vote
COR
2008
15 years 6 months ago
2008
We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficie...
171
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
190
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
203
click to vote
AIPS
2007
15 years 9 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...