Sciweavers

2398 search results - page 111 / 480
» Constraint Programming and Graph Algorithms
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 6 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 6 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
FLAIRS
2004
15 years 6 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
CSR
2009
Springer
15 years 6 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
APVIS
2004
15 years 6 months ago
Skeletal Animation for the Exploration of Graphs
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
Damian Merrick, Tim Dwyer