Search

Search Results

• Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)

  Alessandro Bertagnon, Marco Gavanelli

  1412-1419

  2020-04-03

• Chain Length and CSPs Learnable with Few Queries

  Christian Bessiere, Cl‚ément Carbonnel, George Katsirelos

  1420-1427

  2020-04-03

• Guiding CDCL SAT Search via Random Exploration amid Conflict Depression

  Md Solimul Chowdhury, Martin Müller, Jia You

  1428-1435

  2020-04-03

• Representative Solutions for Bi-Objective Optimisation

  Emir Demirovi?, Nicolas Schwind

  1436-1443

  2020-04-03

• Dynamic Programming for Predict+Optimise

  Emir Demirovi?, Peter J. Stuckey, Tias Guns, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, Jeffrey Chan

  1444-1451

  2020-04-03

• Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction

  Jian-Ya Ding, Chao Zhang, Lei Shen, Shengyin Li, Bing Wang, Yinghui Xu, Le Song

  1452-1459

  2020-04-03

• Optimization of Chance-Constrained Submodular Functions

  Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew Sutton

  1460-1467

  2020-04-03

• ADDMC: Weighted Model Counting with Algebraic Decision Diagrams

  Jeffrey Dudek, Vu Phan, Moshe Vardi

  1468-1476

  2020-04-03

• Modelling and Solving Online Optimisation Problems

  Alexander Ek, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack

  1477-1485

  2020-04-03

• Justifying All Differences Using Pseudo-Boolean Reasoning

  Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordstr”öm

  1486-1494

  2020-04-03

• A Cardinal Improvement to Pseudo-Boolean Solving

  Jan Elffers, Jakob Nordstr”m

  1495-1503

  2020-04-03

• MIPaaL: Mixed Integer Program as a Layer

  Aaron Ferber, Bryan Wilder, Bistra Dilkina, Milind Tambe

  1504-1511

  2020-04-03

• Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources

  Arthur Godet, Xavier Lorca, Emmanuel Hebrard, Gilles Simonin

  1512-1519

  2020-04-03

• SPAN: A Stochastic Projected Approximate Newton Method

  Xunpeng Huang, Xianfeng Liang, Zhengyang Liu, Lei Li, Yue Yu, Yitan Li

  1520-1527

  2020-04-03

• Modelling Diversity of Solutions

  Linnea Ingmar, Maria Garcia de la Banda, Peter J. Stuckey, Guido Tack

  1528-1535

  2020-04-03

• Incremental Symmetry Breaking Constraints for Graph Search Problems

  Avraham Itzhakov, Michael Codish

  1536-1543

  2020-04-03

• Finding Most Compatible Phylogenetic Trees over Multi-State Characters

  Tuukka Korhonen, Matti J„ärvisalo

  1544-1551

  2020-04-03

• FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints

  Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Vardi, Zhiwei Zhang

  1552-1560

  2020-04-03

• Augmenting the Power of (Partial) MaxSat Resolution with Extension

  Javier Larrosa, Emma Rollon

  1561-1568

  2020-04-03

• Solving Set Cover and Dominating Set via Maximum Satisfiability

  Zhendong Lei, Shaowei Cai

  1569-1576

  2020-04-03

• Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining

  Hongbo Li, Jimmy Lee, He Mi, Minghao Yin

  1577-1584

  2020-04-03

• An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning

  Guannan Liang, Qianqian Tong, Chunjiang Zhu, Jinbo Bi

  1585-1592

  2020-04-03

• Accelerating Column Generation via Flexible Dual Optimal Inequalities with Application to Entity Resolution

  Vishnu Suresh Lokhande, Shaofei Wang, Maneesh Singh, Julian Yarkony

  1593-1602

  2020-04-03

• Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems

  Jayanta Mandi, Emir Demirovi?, Peter J. Stuckey, Tias Guns

  1603-1610

  2020-04-03

• Grammar Filtering for Syntax-Guided Synthesis

  Kairo Morton, William Hallahan, Elven Shum, Ruzica Piskac, Mark Santolucito

  1611-1618

  2020-04-03