Sciweavers

14158 search results - page 249 / 2832
» Generalized switch-setting problems
Sort
View
120
Voted
ATAL
2010
Springer
15 years 5 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...
127
Voted
DAM
2008
88views more  DAM 2008»
15 years 4 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
146
Voted
ENDM
2010
101views more  ENDM 2010»
15 years 4 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 4 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
107
Voted
INFORMATICALT
2006
77views more  INFORMATICALT 2006»
15 years 3 months ago
Parallel Numerical Algorithms for 3D Parabolic Problem with Nonlocal Boundary Condition
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
Raimondas Ciegis