Sciweavers

1054 search results - page 39 / 211
» Capacitated Domination Problem
Sort
View
ESWA
2010
101views more  ESWA 2010»
15 years 1 months ago
A note on the truck and trailer routing problem
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of availab...
Shih-Wei Lin, Vincent F. Yu, Shuo-Yan Chou
116
Voted
NETWORKS
2008
15 years 2 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
IPPS
2007
IEEE
15 years 8 months ago
Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Andreas Beham
130
Voted
NETWORKS
2007
15 years 2 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
IJCM
2008
72views more  IJCM 2008»
15 years 2 months ago
ROMAN DOMINATION: a parameterized perspective
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
Henning Fernau