Papers
Beyond Static: Related Questions Retrieval Through Conversations in Community Question Answering
Xiao Ao, Jie Zou, Yibiao Wei et al.
T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin Method
Haoyu Zhu, Yao Zhang, Jiashen Ren et al.
Exact Optimization for Minimum Dominating Sets
Enqiang Zhu, Qiqi Bao, Yu Zhang et al.
Relational Verification for Cost-Aware Quantum Program Optimization
Ziming Zhao, Tingting Li, Zhaoxuan Li et al.
Improving Exact Algorithm for Pseudo Boolean Optimization with Two New Phase Selection Heuristics
Yujiao Zhao, Yizhan Xiang, Jiangnan Li et al.
Right Branches Matter in Failure-based Variable Ordering Heuristics
Yang Zhang, Hongbo Li
Scalable Mixed-Integer Optimization with Neural Constraints via Dual Decomposition
Shuli Zeng, Sijia Zhang, Feng Wu et al.
CSP4SDG: Constraint and Information-Theory Based Role Identification in Social Deduction Games with LLM-Enhanced Inference
Kaijie Xu, Fandi Meng, Clark Verbrugge et al.
Co-Layout: LLM-driven Co-optimization for Interior Layout
Chucheng Xiang, Ruchao Bao, Biyin Feng et al.
Cubing for Tuning
Haoze Wu, Clark Barrett, Nina Narodytska
Generative Branching for Mixed-Integer Linear Programming
Ruobing Wang, Xin Li, Yangchuan Wang et al.
Certified Branch-and-Bound MaxSAT Solving
Dieter Vandesande, Jordi Coll, Bart Bogaerts
A GPU-based Constraint Programming Solver
Pierre Talbot
Assignment Problems in Cost Function Networks
Guidio Sewa, David Allouche, Simon de Givry et al.
Constrained Molecule Generation Modelled Using the Grammar Constraint
David Saikali, Gilles Pesant
LLM-Guided Quantified SMT Solving over Uninterpreted Functions
Kunhang Lv, Yuhang Dong, Rui Han et al.
Scale-Net: A Hierarchical U-Net Framework for Cross-Scale Generalization in Multi-Task Vehicle Routing
Suyu Liu, Zhiguang Cao, Nan Yin et al.
Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
Victor Lagerkvist, Johanna Groven, Leif Eriksson
Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance
Stepan Kochemazov, Oleg Zaikin, Grigorii Trofimiuk et al.
Graph Choosability via SAT: Beyond the Nullstellensatz
Markus Kirchweger, Tomáš Peitl, David Seka et al.
The Limitations and Power of NP-Oracle Based Functional Synthesis Techniques
Brendan Juba, Kuldeep S. Meel
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
Hannes Ihalainen, Dieter Vandesande, André Schidler et al.
Constraint Optimization of MicroPlate Designs
Ramiz Gindullin, María Andreína Francisco Rodríguez
Model Counting for Dependency Quantified Boolean Formulas
Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang et al.
Preference Elicitation for Step-Wise Explanations in Logic Puzzles
Marco Foschini, Marianne Defresne, Emilio Gamba et al.