Ameso optimization: A relaxation of discrete midpoint convexity

Wen Chen, Odysseas Kanavetas, Michael N. Katehakis

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)177-192
Number of pages16
JournalDiscrete Applied Mathematics
StatePublished - Apr 15 2021

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


  • Discrete optimization
  • Integral optimization
  • Recursive procedure


Dive into the research topics of 'Ameso optimization: A relaxation of discrete midpoint convexity'. Together they form a unique fingerprint.

Cite this