1179 search results - page 9 / 236 » Programming in Hybrid Constraint Languages |
PPCP
1993
13 years 11 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Tail Assignment is the problem of assigning flight legs to aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we presen...
BMCBI
2010
13 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
ANOR
2011
13 years 2 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...