A quadratic assignment formulation of the molecular conformation problem
From MaRDI portal
Publication:1319011
DOI10.1007/BF01096724zbMath0797.90116MaRDI QIDQ1319011
Publication date: 12 April 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Related Items
Unnamed Item, A survey for the quadratic assignment problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Diversification-driven tabu search for unconstrained binary quadratic problems, Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Semidefinite program duals for separable polynomial programs involving box constraints, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Parametric Lagrangian dual for the binary quadratic programming problem, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, Lagrangean decompositions for the unconstrained binary quadratic programming problem, A global continuation algorithm for solving binary quadratic programming problems, Conflict Analysis for MINLP, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, A continuation approach for solving binary quadratic program based on a class of NCP-functions, One-pass heuristics for large-scale unconstrained binary quadratic problems, An unconstrained quadratic binary programming approach to the vertex coloring problem
Uses Software
Cites Work
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- On the limited memory BFGS method for large scale optimization
- A parallel algorithm for constrained concave quadratic global minimization
- A parallel stochastic method for solving linearly constrained concave global minimization problems
- Sufficient conditions for solving linearly constrained separable concave global minimization problems
- Molecular conformation on the CM-5 by parallel two-level simulated annealing
- Computational comparison of two methods for constrained global optimization
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Preconditioning of Truncated-Newton Methods
- A Quantitative Theory of Genetic Recombination and Chiasma Formation
- Convex Analysis
