Sciweavers

2343 search results - page 101 / 469
» The Locomotive Routing Problem
Sort
View
ICCSA
2004
Springer
14 years 3 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
COCOON
2006
Springer
14 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
ICICIC
2006
IEEE
14 years 4 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
DAC
2004
ACM
14 years 11 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...
SAC
2005
ACM
14 years 3 months ago
A multi-agent approach for solving optimization problems involving expensive resources
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
Hoong Chuin Lau, Hui Wang