Minimax and applications (Q1907936)
From MaRDI portal
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use this page instead for the normal view: Minimax and applications
scientific article; zbMATH DE number 845441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax and applications |
scientific article; zbMATH DE number 845441 |
Statements
Minimax and applications (English)
0 references
15 February 1996
0 references
The articles of this volume will be reviewed individually. Indexed articles: \textit{Simons, Stephen}, Minimax theorems and their proofs, 1-23 [Zbl 0862.49010] \textit{Diderich, Claude G.; Gengler, Marc}, A survey on minimax trees and associated algorithms, 25-54 [Zbl 0854.68077] \textit{Qi, Liqun; Sun, Wenyu}, An iterative method for the minimax problem, 55-67 [Zbl 0847.90126] \textit{Sturm, Jos F.; Zhang, Shuzhong}, A dual and interior point approach to solve convex min-max problems, 69-78 [Zbl 0845.49003] \textit{Cao, Feng}, Determining the performance ratio of algorithm multifit for scheduling, 79-96 [Zbl 0847.90078] \textit{Chen, Bo; Woeginger, Gerhard J.}, A study of on-line scheduling two-stage shops, 97-107 [Zbl 0847.90079] \textit{Helgason, Thorkell; Jörnsten, Kurt; Migdalas, Athanasios}, Maxmin formulation of the apportionments of seats to a parliament, 109-118 [Zbl 0849.90041] \textit{Hsu, D. Frank; Hu, Xiao-Dong; Kajitani, Yoji}, On shortest \(K\)-edge connected Steiner networks with rectilinear distance, 119-127 [Zbl 0854.68078] \textit{Teng, Shang-Hua}, Mutually repellant sampling, 129-140 [Zbl 0854.68081] \textit{Vicente, Luis N.; Calamai, Paul H.}, Geometry and local optimality conditions for bilevel programs with quadratic strictly convex lower levels, 141-151 [Zbl 0847.90129] \textit{Xue, Guoliang; Sun, Shangzhi}, The spherical one-center problem, 153-156 [Zbl 0847.90092] \textit{Yu, Gang; Kouvelis, Panagiotis}, On min-max optimization of a collection of classical discrete optimization problems, 157-171 [Zbl 0847.90105] \textit{Dress, Andreas W. M.; Yang, Lu; Zeng, Zhenbing}, Heilbronn problem for six points in a planar convex body, 173-190 [Zbl 0879.52001] \textit{Yang, Lu; Zeng, Zhenbing}, Heilbronn problem for seven points in a planar convex body, 191-218 [Zbl 0879.52002] \textit{Ko, Ker-I; Lin, Chih-Long}, On the complexity of min-max optimization problems and their approximation, 219-239 [Zbl 0847.90117] \textit{Hu, X. D.; Hwang, F. K.}, A competitive algorithm for the counterfeit coin problem, 241-250 [Zbl 0847.90115] \textit{Gu, Jun}, A minimax \(\alpha\beta\) relaxation for global optimization, 251-268 [Zbl 0847.90123] \textit{Cao, Feng; Du, Ding-Zhu; Gao, Biao; Wan, Peng-Jun; Pardalos, Panos M.}, Minimax problems in combinatorial optimization, 269-292 [Zbl 0847.90113]
0 references
Minimax
0 references