A decomposition approach for global optimum search in QP, NLP and MINLP problems

A. Aggarwal; Christodoulos A. Floudas

doi:10.1007/bf02283690

ScienceGate Book Chapters

JOURNAL ARTICLE

A decomposition approach for global optimum search in QP, NLP and MINLP problems

A. Aggarwal Christodoulos A. Floudas

Year: 1990 Journal: Annals of Operations Research Vol: 25 (1)Pages: 119-145 Publisher: Springer Science+Business Media

DOI: 10.1007/bf02283690

Get Full-Text PDF Get Analytical Report

Keywords:

Theory of computation Mathematical optimization Decomposition Selection (genetic algorithm) Set (abstract data type) Constraint (computer-aided design) Decomposition method (queueing theory) Mathematics Computer science Global optimization Variable (mathematics) Optimization problem Benders' decomposition Series (stratigraphy) Key (lock) Algorithm Artificial intelligence

Metrics

Cited By

2.32

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Target Tracking and Data Fusion in Sensor Networks

Physical Sciences → Computer Science → Artificial Intelligence

AI-based Problem Solving and Planning

Physical Sciences → Computer Science → Artificial Intelligence

A decomposition approach for global optimum search in QP, NLP and MINLP problems

Metrics

Citation History

Topics

Related Documents

Global optimum search for nonconvex NLP and MINLP problems

Gene Clustering: A Novel Decomposition-Based Clustering Approach: Global Optimum Search with Enhanced Positioning

A Decomposition Strategy for Global Optimum Search in the Pooling Problem

Global Optimum Search Technique for Non-Convex Groundwater Management Problems

Using Tabu search to solve MINLP problems for PSE