Solving discrete minimax problems using interval arithmetic

MaRDI QIDQ5488947zbMATH OpenFDO

Authors D. G. Sotiropoulos

Publication date 25 September 2006

zbMATH Keywords

maximum entropybranch-and-prunelinear pruning steps

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Algorithms with automatic result verification (65G20)

Recommendations

• On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic
• scientific article; zbMATH DE number 1159798
• Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems
• Solving minimax problems by interval methods
• scientific article; zbMATH DE number 1292983

Cited in

(7)

• On the resolution of certain discrete univariate max-min problems
• Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems
• Development of modal interval algorithm for solving continuous minimax problems
• Solving minimax problems by interval methods
• Continuous minimax optimization using modal intervals
• scientific article; zbMATH DE number 1159798 (Why is no real title available?)
• On discrete minimax problems in \(\mathbb{R}\) using interval arithmetic

Describes a project that uses

Uses Software

• C-XSC
• C-XSC 2.0

This page was built for publication: Solving discrete minimax problems using interval arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488947)