• Corpus ID: 6658197

Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application

  title={Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application},
  author={Xiao-Feng Xie and Zun-Jing Wang},
In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we show how to exploit the local search structure to formulate the problem landscape for dramatic reductions in search space and for non-trivial elimination in search barriers, and then to realize intelligent search strategies for effectively escaping from local… 

Figures and Tables from this paper


Algorithm portfolios
When Gravity Fails: Local Search Topology
It is shown that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large.
Sequential Model-Based Optimization for General Algorithm Configuration
This paper extends the explicit regression models paradigm for the first time to general algorithm configuration problems, allowing many categorical parameters and optimization for sets of instances, and yields state-of-the-art performance.
A review of metrics on permutations for search landscape analysis
Recursive Decomposition for Nonconvex Optimization
It is shown analytically that RDIS can solve a broad class of nonconvex optimization problems exponentially faster than gradient descent with random restarts, and experimentally, RDIS outperforms standard techniques on problems like structure from motion and protein folding.
On the Landscape of Combinatorial Optimization Problems
This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment with a fairly comprehensive description of the properties, including the expected time to reach a local optimum.
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem
This paper studies phase transitions of the asymmetric Traveling Salesman Problem, an NP-hard combinatorial optimization problem that has many real-world applications and empirically shows that many properties of the problem, including the optimal tour cost and backbone size, experience sharp transitions as the precision of intercity distances increases across a critical value.
Directed Plateau Search for MAX-k-SAT
It is shown that embedding the gradient computation into a hill-climbing local search for MAX-k-SAT improves its convergence profile and gives the mean value of the objective function over localized volumes of the search space.
Backbones in Optimization and Approximation
The impact of backbones in optimization and approximation problems is studied to find that to observe the impact of backbone size on problem hardness, it is necessary to eliminate some symmetries, perform trivial reductions and factor out the effective problem size.
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
A heuristic search for variables belonging to the backbone of a 3-SAT formula which are chosen as branch nodes for the tree developed by a DPL-type procedure is defined, making it possible to handle unsatisfiable hard 3- SAT formulae up to 700 variables.