Adaptive memory programming for constrained global optimization
From MaRDI portal
Publication:2379660
DOI10.1016/J.COR.2009.11.006zbMATH Open1183.90459OpenAlexW2097207940MaRDI QIDQ2379660FDOQ2379660
Authors: Abraham Duarte, Fred Glover, Manuel Laguna, Rafael Martí, Leon Lasdon 
Publication date: 19 March 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.11.006
Recommendations
- Hybrid scatter tabu search for unconstrained global optimization
- Adaptive memory programming: a unified view of metaheuristics
- A fast memoryless interval-based algorithm for global optimization
- scientific article; zbMATH DE number 2205687
- Computational comparison of two methods for constrained global optimization
Cites Work
- CONOPT—A Large-Scale GRG Code
- Title not available (Why is that?)
- Tabu Search—Part I
- Scatter search and local NLP solvers: a multistart framework for global optimization
- Handbook of test problems in local and global optimization
- Title not available (Why is that?)
- Hybrid scatter tabu search for unconstrained global optimization
- Perturbation approach to sensitivity analysis in mathematical programming
- Title not available (Why is that?)
- Solving Large Sparse Nonlinear Programs Using GRG
Cited In (10)
- An adaptive memory programming method for risk logistics operations
- A stochastic local search algorithm for constrained continuous global optimization
- Title not available (Why is that?)
- Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Title not available (Why is that?)
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- Adaptive memory programming: a unified view of metaheuristics
- A quasi-multistart framework for global optimization of expensive functions using response surface models
Uses Software
This page was built for publication: Adaptive memory programming for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379660)
