13841 search results - page 271 / 2769 » Algorithms and Constraint Programming |
175
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
181
click to vote
JAIR
2008
15 years 6 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
174
click to vote
JOTA
2011
15 years 1 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
215
click to vote
IOR
2011
15 years 1 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
130
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...