706 search results - page 62 / 142 » Super Solutions in Constraint Programming |
IOR
2010
14 years 9 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
105
click to vote
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
278
click to vote
ICAL
2011
13 years 11 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
CP
2004
Springer
15 years 5 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
111
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...