Sciweavers

2543 search results - page 30 / 509
» Optimal Ordered Problem Solver
Sort
View
JEA
2008
88views more  JEA 2008»
13 years 10 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
CPAIOR
2010
Springer
13 years 8 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
GECCO
2006
Springer
212views Optimization» more  GECCO 2006»
14 years 1 months ago
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator-Non-Wrapping Order Crossover (NWOX)--is a variation of the well-...
Vincent A. Cicirello
ORL
2006
65views more  ORL 2006»
13 years 10 months ago
Solving asymmetric variational inequalities via convex optimization
Using duality, we reformulate the asymmetric variational inequality (VI) problem over a conic region as an optimization problem. We give sufficient conditions for the convexity of...
Michele Aghassi, Dimitris Bertsimas, Georgia Perak...
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
14 years 3 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon