Sciweavers

126 search results - page 12 / 26
» Surrogate constraint normalization for the set covering prob...
Sort
View
EOR
2010
159views more  EOR 2010»
13 years 2 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CSCLP
2007
Springer
14 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
ASPDAC
2009
ACM
130views Hardware» more  ASPDAC 2009»
14 years 1 months ago
Analog placement with common centroid and 1-D symmetry constraints
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
Linfu Xiao, Evangeline F. Y. Young
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 7 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...