Lower and upper bounds for the allocation problem and other nonlinear optimization problems

Parametric polymatroid optimization and its geometric applications

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

An efficient algorithm for image segmentation, Markov random fields and related problems

Journal of the ACM (JACM)

Optimal partition of QoS requirements on unicast paths and multicast trees

IEEE/ACM Transactions on Networking (TON)

A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Minimizing a Convex Cost Closure Set

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms

Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization

Discrete Applied Mathematics - Submodularity

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem

Discrete Applied Mathematics

Efficient QoS partition and routing of unicast and multicast

IEEE/ACM Transactions on Networking (TON)

On Convex Minimization over Base Polytopes

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Minimum entropy orientations

Operations Research Letters

A nonlinear Knapsack problem

Operations Research Letters

A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems

Operations Research Letters

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra

SIAM Journal on Discrete Mathematics