1002 search results - page 107 / 201 » Constraint Answer Set Solving |
EPIA
1999
Springer
14 years 15 days ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
COR
2007
13 years 8 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
ATMOS
2010
13 years 7 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...