Experimental complexity analysis of continuous constraint satisfaction problems.

DOI10.1016/S0020-0255(03)00065-3zbMath1069.68601MaRDI QIDQ1425278

Yi Shang, Markus P. J. Fromherz

Publication date: 15 March 2004

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

3-SAT problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Computational experience with an interior point algorithm on the satisfiability problem
• SWIFT - a new constrained optimization technique
• A globally convergent method for nonlinear programming
• The hardest constraint problems: A double phase transition
• Exploiting the deep structure of constraint problems
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• An approach to nonlinear programming
• Phase transitions and the search problem
• Generating hard satisfiability problems
• A study of complexity transitions on the asymmetric traveling salesman problem
• `` Direct Search Solution of Numerical and Statistical Problems
• Direct Search Methods on Parallel Machines
• On the Convergence of the Multidirectional Search Algorithm
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• A New Method of Constrained Optimization and a Comparison With Other Methods
• A Simplex Method for Function Minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item