极小极大
设施选址问题
有界函数
平面(几何)
数学
单中心问题
集合(抽象数据类型)
代表(政治)
旋转(数学)
组合数学
平方(代数)
数学优化
几何学
数学分析
计算机科学
政治
政治学
程序设计语言
法学
标识
DOI:10.1080/05695557208974870
摘要
A minimax location problem is considered which involves finding the location of a facility in the plane so that the maximum rectilinear distance between the facility and an arbitrary, but fixed, nonempty and bounded set in the plane will be minimized. A geometrical procedure is developed for finding all solutions to the problem. The derivation of the solution procedure, which is based on the fact that the minimax problem is equivalent to the problem of enclosing the representation of the set after a 45 degree rotation within a smallest square, is believed to be a particularly intuitive one.
科研通智能强力驱动
Strongly Powered by AbleSci AI