Solving discrete minimax problems using interval arithmetic

MaRDI QIDQ5488947zbMATH OpenFDO

Authors D. G. Sotiropoulos

Publication date 25 September 2006

zbMATH Keywords

branch-and-prunelinear pruning stepsmaximum entropy

Mathematics Subject Classification ID

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

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

(10)

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

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)