TY - JOUR
T1 - Ameso optimization
T2 - A relaxation of discrete midpoint convexity
AU - Chen, Wen
AU - Kanavetas, Odysseas
AU - Katehakis, Michael N.
N1 - Funding Information:
We acknowledge support for this work from the National Science Foundation, NSF, United States of America grant CMMI-16-62629 .
Publisher Copyright:
© 2020 Elsevier B.V.
PY - 2021/4/15
Y1 - 2021/4/15
N2 - In this paper we introduce the Ameso optimization problem, a special class of discrete optimization problems. We establish its basic properties and investigate the relation between Ameso optimization and the convex optimization. Further, we design an algorithm to solve a multi-dimensional Ameso problem by solving a sequence of one-dimensional Ameso problems. Finally, we demonstrate how the knapsack problem can be solved using the Ameso optimization framework.
AB - In this paper we introduce the Ameso optimization problem, a special class of discrete optimization problems. We establish its basic properties and investigate the relation between Ameso optimization and the convex optimization. Further, we design an algorithm to solve a multi-dimensional Ameso problem by solving a sequence of one-dimensional Ameso problems. Finally, we demonstrate how the knapsack problem can be solved using the Ameso optimization framework.
KW - Discrete optimization
KW - Integral optimization
KW - Recursive procedure
UR - http://www.scopus.com/inward/record.url?scp=85097066490&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097066490&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2020.11.004
DO - 10.1016/j.dam.2020.11.004
M3 - Article
AN - SCOPUS:85097066490
SN - 0166-218X
VL - 293
SP - 177
EP - 192
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -