Sciweavers

14649 search results - page 333 / 2930
» Principles of problem solving
Sort
View
ENDM
2010
112views more  ENDM 2010»
15 years 4 months ago
On the complexity of the Eulerian closed walk with precedence path constraints problem
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
Hervé Kerivin, Mathieu Lacroix, Ali Ridha M...
AUSAI
2005
Springer
16 years 7 days ago
A Multi-exchange Heuristic for a Production Location Problem
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigue...
EVOW
2005
Springer
16 years 6 days ago
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
Jano I. van Hemert
EVOW
2004
Springer
16 years 2 days ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
STACS
2004
Springer
16 years 21 hour ago
Desert Automata and the Finite Substitution Problem
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
Daniel Kirsten