| 来源类型 | Article |
| 规范类型 | 其他 |
| DOI | 10.1007/BF01580451 |
| Improved integer programming bounds using intersections of corner polyhedra. | |
| Bell DE; Fisher ML | |
| 发表日期 | 1975 |
| 出处 | Mathematical Programming 89 (1): 345-368 |
| 出版年 | 1975 |
| 语种 | 英语 |
| 摘要 | Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP basis for which the associated relaxation is stronger. These criteria may be successively applied to obtain either an optimal IP solution or a lower bound on the cost of such a solution. Conditions are given for equality of the convex hull of feasible IP solutions and the intersection of all corner polyhedra. |
| 主题 | System and Decision Sciences - Core (SDS) |
| URL | http://pure.iiasa.ac.at/id/eprint/208/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 引用统计 | |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/126576 |
| 推荐引用方式 GB/T 7714 | Bell DE,Fisher ML. Improved integer programming bounds using intersections of corner polyhedra.. 1975. |
| 条目包含的文件 | 条目无相关文件。 | |||||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Bell DE]的文章 |
| [Fisher ML]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Bell DE]的文章 |
| [Fisher ML]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Bell DE]的文章 |
| [Fisher ML]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
