Sciweavers

176 search results - page 8 / 36
» heuristics 1998
Sort
View
NJC
1998
86views more  NJC 1998»
13 years 7 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
COR
2007
163views more  COR 2007»
13 years 7 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
ORL
1998
116views more  ORL 1998»
13 years 7 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
TCAD
1998
86views more  TCAD 1998»
13 years 7 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
FIW
1998
130views Communications» more  FIW 1998»
13 years 9 months ago
A Heuristic Approach to Detect Feature Interactions in Requirements
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...
Maritta Heisel, Jeanine Souquières