306 search results - page 8 / 62 » On the Minimal Uncompletable Word Problem |
EOR
2008
13 years 7 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
DAM
2011
13 years 2 months ago
2011
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
MP
1998
13 years 7 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
COR
2007
13 years 7 months ago
2007
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...