Parallel search algorithms in global optimization

DOI10.1016/0096-3003(89)90014-3zbMath0663.65061OpenAlexW2066760489MaRDI QIDQ1114315

Panos M. Pardalos

Publication date: 1989

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(89)90014-3

zbMATH Keywords

global optimizationlinear complementary problemmultiple-cost-row linear programmingparallel search algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (7)

A parallel algorithm for semi-infinite programming ⋮ Global search algorithms for minimum concave-cost network flow problems ⋮ Linear complementarity problems and multiple objective programming ⋮ Generallized Linear Complementarity Problem and Multiobjective Programming Problem ⋮ Capturing incomplete information in resource allocation problems through numerical patterns ⋮ Parallel computing in nonconvex programming ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems

Uses Software

• MINOS

Cites Work

• Constrained global optimization: algorithms and applications
• Linear programming is log-space hard for P
• On the application of parallel architectures to a class of operations research problems
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global Optimization Approach to the Linear Complementarity Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel search algorithms in global optimization