.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
MATHEMATICAL PROGRAMMING
NONCONVEX PROGRAMMING
CUTTING PLANE METHODS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveRapid accumulation of elastin and collagen in the aortas of sheep in the immediate perinatal period.
OAAI
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more