1144 search results - page 1 / 229 » Logic programming for combinatorial problems |
AIR
2010
13 years 5 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
EUSFLAT
2009
13 years 3 months ago
2009
CP
2005
Springer
13 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
IOR
2006
13 years 5 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...