10 citations · 10 across the 3 of their papers we have counts for
4 papers
AutoPBO: LLM-powered Optimization for Local Search PBO Solvers
Jinyuan Li, Yi Chu, Yiwen Sun +2
Pseudo-Boolean Optimization (PBO) provides a powerful framework for modeling combinatorial problems through pseudo-Boolean (PB) constraints. Local search solvers have shown excelle…
New Characterizations and Efficient Local Search for General Integer Linear Programming
Peng Lin, Shaowei Cai, Mengchuan Zou +1
Integer linear programming (ILP) models a wide range of practical combinatorial optimization problems and significantly impacts industry and management sectors. This work proposes…
(α, β)-Modules in Graphs
Michel Habib, Lalla Mouatadid, Eric Sopena +1
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a singl…
Approximation Strategies for Generalized Binary Search in Weighted Trees
Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski +1
We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node in a given tree . Upon querying a node…