Sciweavers

16596 search results - page 468 / 3320
» Generalized Assignment Problems
Sort
View
AIPS
2006
15 years 9 months ago
On the Use of UML.P for Modeling a Real Application as a Planning Problem
There is a great interest in the planning community to apply all developments already achieved in the area to real applications. Such scenario makes the community focus on Knowled...
Tiago Stegun Vaquero, Flavio Tonidandel, Leliane N...
FLAIRS
2000
15 years 9 months ago
A Deterministic Algorithm for Solving Imprecise Decision Problems
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...
Håkan L. S. Younes, Love Ekenberg
ATAL
2010
Springer
15 years 8 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
ENDM
2010
101views more  ENDM 2010»
15 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
DAM
2006
191views more  DAM 2006»
15 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart