About strongly polynomial time algorithms for quadratic optimization over submodular constraints

A survey of scheduling with controllable processing times

Discrete Applied Mathematics

Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Inverse scheduling with maximum lateness objective

Journal of Scheduling

Inverse scheduling: two-machine flow-shop problem

Journal of Scheduling

Convex and Network Flow Optimization for Structured Sparsity

The Journal of Machine Learning Research

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

Two-machine open shop problem with controllable processing times

Discrete Optimization

Quadratic resource allocation with generalized upper bounds

Operations Research Letters

Polymatroid Optimization, Submodularity, and Joint Replenishment Games

Operations Research

Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance

Journal of Scheduling