Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

TABU search methodology in global optimization

From MaRDI portal
Publication:1962982
Jump to:navigation, search

DOI10.1016/S0898-1221(99)00064-4zbMath0931.90051MaRDI QIDQ1962982

Vera V. Kovacevic-Vujcic, Mirjana Čangalović, Miroslav D. Asic, L. D. Ivanović, Milan D. Dražić

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)


zbMATH Keywords

global optimizationheuristic methodsTABU search


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)


Related Items

Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. ⋮ Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem ⋮ Global optimizations and tabu search based on memory


Uses Software

  • Tabu search


Cites Work

  • Constrained global optimization: algorithms and applications
  • An implicit enumeration method for global optimization problems
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1962982&oldid=14409487"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki