Experimental complexity analysis of continuous constraint satisfaction problems.
type: Item
instance of: scholarly article
title: Experimental complexity analysis of continuous constraint satisfaction problems.
zbMATH Open document ID: 1069.68601
DOI: 10.1016/S0020-0255(03)00065-3
author: Yi Shang
author: Markus P. J. Fromherz
published in: Information Sciences
publication date: 2004-03-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2057895
zbMATH Keywords: 3-SAT problems
MaRDI profile type: Publication
cites work: Q5684511
cites work: A New Method of Constrained Optimization and a Comparison With Other Methods
cites work: Q4403650
cites work: Q3844775
cites work: Direct Search Methods on Parallel Machines
cites work: Q3882253
cites work: Q4375757
cites work: A globally convergent method for nonlinear programming
cites work: Phase transitions and the search problem
cites work: The hardest constraint problems: A double phase transition
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Computational experience with an interior point algorithm on the satisfiability problem
cites work: Q4499963
cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
cites work: An approach to nonlinear programming
cites work: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
cites work: A Simplex Method for Function Minimization
cites work: Q3048600
cites work: Q4794211
cites work: Generating hard satisfiability problems
cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems
cites work: SWIFT - a new constrained optimization technique
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: Exploiting the deep structure of constraint problems
cites work: A study of complexity transitions on the asymmetric traveling salesman problem
description: scientific article; zbMATH DE number 2057895