706 search results - page 32 / 142 » Super Solutions in Constraint Programming |
102
click to vote
AICCSA
2001
IEEE
15 years 3 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
CONSTRAINTS
2000
14 years 11 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
148
click to vote
ISPD
2012
ACM
13 years 7 months ago
2012
ACM
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...