673 search results - page 104 / 135 » Preference-Based Problem Solving for Constraint Programming |
105
Voted
MP
2010
15 years 18 days ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
171
Voted
JDCTA
2010
14 years 9 months ago
2010
To solve the cruise two-dimensional revenue management problem and develop such an automated system under uncertain environment, a static model which is a stochastic integer progr...
113
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
137
click to vote
PPDP
2010
Springer
15 years 17 days ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
151
Voted
POPL
1992
ACM
15 years 6 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...