启发式
整数规划
简单(哲学)
集合(抽象数据类型)
固定填料
数学
数学优化
多面体
整数(计算机科学)
计算机科学
理论计算机科学
离散数学
认识论
哲学
程序设计语言
作者
Jakob Krarup,Peter Pruzan
标识
DOI:10.1016/0377-2217(83)90181-9
摘要
With emphasis on the simple plant location problem, (SPLP), we consider an important family of discrete, deterministic, single-criterion, NP-hard, and widely applicable optimization problems. The introductory discussion on problem formulation aspects is followed by the establishment of relationships between SPLP and set packing, set covering and set partitioning problems which all are among those structures in integer programming having the most wide-spread applications. An extensive discourse on solution properties and computational techniques, spanning from early heuristics to the presumably most novel exact methods is then provided. Other subjects of concern include a subfamily of SPLP's solvable in polynomial time, analyses of approximate algorithms, transformability of p-CENTER and p-MEDIAN to SPLP, and structural properties of the SPLP polytope. Along the way we attempt to synthesize these findings and relate them to other areas of integer programming.
科研通智能强力驱动
Strongly Powered by AbleSci AI