activity
20042023
most citedTractability and Decompositions of Global Cost Functions

16 citations · 38 across the 9 of their papers we have counts for

collaborators
Showing cs.AIShow all

7 papers · 1 filter

cs.AI2022★ 3 cited

Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraints

Xinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee

Predict+Optimize is a recently proposed framework which combines machine learning and constrained optimization, tackling optimization problems that contain parameters that are unkn…

cs.AI2018

Augmenting Stream Constraint Programming with Eventuality Conditions

Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. Zhong

Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Pr…

cs.AI2015★ 16 cited

Tractability and Decompositions of Global Cost Functions

David Allouche, Christian Bessiere, Patrice Boizumault +8

Enforcing local consistencies in cost function networks is performed by applying so-called Equivalent Preserving Transformations (EPTs) to the cost functions. As EPTs transform the…

cs.AI2014★ 15 cited

Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction

J. H. M. Lee, Ka Lun Leung

Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for…

cs.AI2011

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming

Yat-Chiu Law, Jimmy Ho-Man Lee, May Hiu-Chun Woo +1

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful in…

cs.AI2006

Islands for SAT

H. Fang, Y. Kilani, J. H. M. Lee +1

In this note we introduce the notion of islands for restricting local search. We show how we can construct islands for CNF SAT problems, and how much search space can be eliminated…