Ameso optimization: a relaxation of discrete midpoint convexity

DOI10.1016/j.dam.2020.11.004OpenAlexW3108503831MaRDI QIDQ2659175

Yanyan Li

Publication date: 25 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.12429

zbMATH Keywords

recursive procedurediscrete optimizationintegral optimization

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Nonlinear discrete optimization. An algorithmic theory
• A capacity scaling algorithm for M-convex submodular flow
• Some specially structured assemble-to-order systems
• Complexity and algorithms for nonlinear optimization problems
• Multi‐Armed Bandit Allocation Indices
• A Linear Programming Approach to the Cutting-Stock Problem
• Nonlinear Integer Programming
• The Multi-Armed Bandit Problem: Decomposition and Computation
• The stochastic knapsack problem
• Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• The Theory and Computation of Knapsack Functions
• Convex separable optimization is not much harder than linear optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ameso optimization: a relaxation of discrete midpoint convexity