Sciweavers

706 search results - page 7 / 142
» Super Solutions in Constraint Programming
Sort
View
77
Voted
AAAI
2008
15 years 1 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
CSR
2009
Springer
15 years 21 days ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
CPAIOR
2006
Springer
15 years 3 months ago
A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem
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...
Sami Gabteni, Mattias Grönkvist
100
Voted
EOR
2010
113views more  EOR 2010»
14 years 11 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
107
Voted
COCOA
2008
Springer
15 years 21 days ago
Automatic Generation of Symmetry-Breaking Constraints
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
Leo Liberti