Solving 0-1 Minimax Problems

DOI10.2307/2582765MaRDI QIDQ3754438zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582765

zbMATH Keywords

minisum problemminimax 0-1 programming

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09)

Recommendations

• Finding approximate solutions to minimax problems
• The solution of discrete minimax problems
• scientific article; zbMATH DE number 4103825
• scientific article; zbMATH DE number 4136844
• scientific article; zbMATH DE number 939066
• Solving minimax problems by interval methods
• scientific article; zbMATH DE number 757679
• scientific article; zbMATH DE number 5027086
• scientific article; zbMATH DE number 895371
• Exact Solutions for Minimax Optimization Problems

Cited in

(5)

• Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
• Remarks on 0-1 optimization problems with superincreasing and superdecreasing objective functions
• Generalized multiple objective bottleneck problems
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• Finding approximate solutions to minimax problems

This page was built for publication: Solving 0-1 Minimax Problems

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