13376 search results - page 310 / 2676 » Problem Solving with |
128
Voted
WEA
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
166
click to vote
IICAI
2003
15 years 5 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
138
Voted
ATAL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
150
click to vote
RSEISP
2007
Springer
15 years 10 months ago
2007
Springer
The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose ...
115
click to vote
COMPSAC
2007
IEEE
15 years 10 months ago
2007
IEEE
Design patterns encode proven solutions to recurring design problems. To use a design pattern properly, we need to 1) understand the design problem the pattern resolves, 2) recogn...