Sciweavers

1404 search results - page 82 / 281
» Optimization problems in multiple-interval graphs
Sort
View
DISOPT
2008
93views more  DISOPT 2008»
14 years 10 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
DGCI
2009
Springer
15 years 1 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
15 years 3 months ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
15 years 3 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
GBRPR
2007
Springer
15 years 4 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...