approximation may outperform not only the standard greedy algorithm but also the inner matroid approximation proposed by Milgrom … [2017]. Second, we generalize the inner approximation framework of independence systems to inner approximations of packing … maximizing a separable discrete concave function and show that our inner approximation can be better than the greedy algorithm …

the value function approximation provides benefits and that the best choice of features leads to an average improvement of …

-integer convex optimization problems. The algorithm constructs an inner and outer approximation of the front exploiting the convexity … not refined further. We prove that the algorithm converges and show a bound on the reduction of the approximation error in …