Convex separable optimization is not much harder than linear optimization
Journal of the ACM (JACM)
Subdomain dependence test for massive parallelism
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Non-standard approaches to integer programming
Discrete Applied Mathematics
Two sensitivity theorems in fuzzy integer programming
Discrete Applied Mathematics
Sensitivity Analysis for Scheduling Problems
Journal of Scheduling
Stability Analysis of Some Discrete Optimization Algorithms
Automation and Remote Control
Duality in optimization and constraint satisfaction
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Scheduling jobs on identical and uniform processors revisited
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
On the relationship between the integer and continuous solutions of convex programs
Operations Research Letters
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
A robust AFPTAS for online bin packing with polynomial migration,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |