14548 search results - page 48 / 2910 » The Optimal Path-Matching Problem |
IJCGA
2010
13 years 8 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
JCO
2010
13 years 8 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
INFORMS
2010
13 years 7 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
MST
2010
13 years 4 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
GECCO
2011
Springer
13 years 1 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...