A Class of Cuts and Related Algorithms in Integer Programming

机译：整数规划中的一类切割及相关算法

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

A new family of intersection cuts is obtained from a class of convex polyhedra (generalized octahedra). It is shown that these cuts can also be obtained as convex combinations of the Gomory mixed integer cuts. A constructive approach to obtain improved (i.e. deeper) cuts is then presented and discussed. (Author)

著录项

作者
Burdet, C. A.;
展开▼
作者单位

展开▼
年度 1970
页码 p.1-46
总页数 46
原文格式 PDF
正文语种 eng
中图分类
关键词
Mathematical programming ; Algorithms ; Matrix algebra ; Set theory ; Inequalities ; Iterative methods ; Optimization;

机译：数学规划;算法;矩阵代数;集合论;不等式;迭代法;优化;

相似文献

外文文献
中文文献
专利

1. Classical Cuts for Mixed-Integer Programming and Branch-and-Cut [J] . MANFRED PADBERG Annals of Operations Research . 2005 ,第期

机译：混合整数编程和分支剪切的经典剪切
2. Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs [J] . Dinakar Gade, Simge Kü?ükyavuz, Suvrajeet Sen Mathematical Programming . 2014 ,第1a2aPta1期

机译：两阶段随机整数程序的带参数Gomory割的分解算法
3. Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs [J] . H. Van Maaren, C. Dang Journal of combinatorial optimization . 2002 ,第2期

机译：用于贸易类别的整数程序的单纯枢转算法
4. Generating Benders Cuts for a General Class of Integer Programming Problems [C] . Yingyi Chu, Quanshi Xia International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems(CPAIOR 2004); 20040420-20040422; Nice; FR . 2004

机译：为一般的整数编程问题生成Benders割
5. Branch-and-cut algorithms for conic mixed-integer programming. [D] . Narayanan, Vishnu Bhama. 2008

机译：圆锥混合整数编程的分支剪切算法。
6. Rarity-Weighted Richness: A Simple and Reliable Alternative to Integer Programming and Heuristic Algorithms for Minimum Set and Maximum Coverage Problems in Conservation Planning [O] . Fabio Albuquerque, Paul Beier -1

机译：稀有加权丰富度：保护规划中最小集和最大覆盖率问题的整数规划和启发式算法的简单可靠的替代方案
7. An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming [O] . Arsalan Rahmani, Majid Yousefikhoshbakht 2017

机译：一种有效的分枝切割算法，用于求解混合整数双层规划
8. Finite Pure Integer Programming Algorithms Employing Only Hyperspherically Deduced Cuts [R] . Young, R. D. 1971

机译：有限纯整数规划算法仅采用超弹性推导削减

A Class of Cuts and Related Algorithms in Integer Programming

摘要

著录项

相似文献

相关主题

期刊订阅