.png){kind=icon}
返回
A FINITE ALGORITHM FOR SOLVING THE GENERALIZED LATTICE POINT PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90256-U.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We deal with the nonconvex program called Generalized Lattice Point Problem. Here, a linear function is to be minimized over such points of a polyhedron which belong to the at most q-dimensional faces of another polyhedron. We present a finite cutting plane algorithm for solving the considered problem. Computational experience is also provided.
Keyword:
MATHEMATICAL PROGRAMMING
NONCONVEX PROGRAMMING
CUTTING PLANE METHODS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Rapid accumulation of elastin and collagen in the aortas of sheep in the immediate perinatal period.
OAAI
OAAI分享收藏分享收藏
查看更多内容