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

Search heuristics for box decomposition methods

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

DOI10.1023/A:1016246616462zbMath1026.90100OpenAlexW1598317541MaRDI QIDQ1862173

Stefan Ratschan

Publication date: 10 March 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016246616462


zbMATH Keywords

minimax optimizationglobal optimizationheuristicsquantified constraints


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)


Related Items (1)

Efficient solution of a class of quantified constraints with quantifier prefix exists-forall


Uses Software

  • INTOPT_90





This page was built for publication: Search heuristics for box decomposition methods

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1862173&oldid=14255096"
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 11:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki