Sciweavers

2 search results - page 1 / 1
» Exploiting Inference Rules to Compute Lower Bounds for MAX-S...
Sort
View
IJCAI
2007
13 years 5 months ago
Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...
Han Lin, Kaile Su
ATAL
2009
Springer
13 years 11 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...