This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...
Francisco J. Vico, Francisco J. Veredas, Jos&eacut...
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
There is a variety of applications that can benefit from the ability to find optimal or good solutions to a proposed problem automatically. The Artificial Intelligent (AI) communi...