Sensitivity theorems in integer linear programming
Mathematical Programming: Series A and B
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A polynomial algorithm for an integer quadratic non-separable transportation problem
Mathematical Programming: Series A and B
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Polynomial methods for separable convex optimization in unimodular spaces
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A capacity scaling algorithm for convex cost submodular flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for image segmentation, Markov random fields and related problems
Journal of the ACM (JACM)
Task scheduling and voltage selection for energy minimization
Proceedings of the 39th annual Design Automation Conference
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Solving the Convex Cost Integer Dual Network Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal Net Surface Problems with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Solving the Convex Cost Integer Dual Network Flow Problem
Management Science
Active mode leakage reduction using fine-grained forward body biasing strategy
Proceedings of the 2004 international symposium on Low power electronics and design
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Cost minimization of multi-tiered e-business infrastructure with end-to-end delay guarantees
ACM SIGMETRICS Performance Evaluation Review
Leakage control through fine-grained placement and sizing of sleep transistors
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Optimal capacity allocation for Web systems with end-to-end delay guarantees
Performance Evaluation - Performance 2005
Active mode leakage reduction using fine-grained forward body biasing strategy
Integration, the VLSI Journal
Spare capacity provisioning for quasi-static traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling with integer time budgeting for low-power optimization
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
Computational Optimization and Applications
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Global optimization for first order Markov Random Fields with submodular priors
Discrete Applied Mathematics
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Journal of Scheduling
Slack allocation algorithm for parallel machines
Journal of Parallel and Distributed Computing
Scheduling with soft constraints
Proceedings of the 2009 International Conference on Computer-Aided Design
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
A greedy buffer allocation algorithm for power-aware communication in body sensor networks
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Ranking sports teams and the inverse equal paths problem
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Variation-aware layout-driven scheduling for performance yield optimization
Proceedings of the International Conference on Computer-Aided Design
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Journal of the ACM (JACM)
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
Operations Research Letters
Selfish splittable flows and NP-completeness
Computer Science Review
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Operations Research Letters
Bounds for global optimization of capacity expansion and flow assignment problems
Operations Research Letters
On the relationship between the integer and continuous solutions of convex programs
Operations Research Letters
Efficient methods for selfish network design
Theoretical Computer Science
Polymatroid Optimization, Submodularity, and Joint Replenishment Games
Operations Research
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
| Hi-index | 0.01 |
The polynomiality of nonlinear separable convex (concave) optimization problems, on linear constraints with a matrix with “small” subdeterminants, and the polynomiality of such integer problems, provided the inteter linear version of such problems ins polynomial, is proven. This paper presents a general-purpose algorithm for converting procedures that solves linear programming problems. The conversion is polynomial for constraint matrices with polynomially bounded subdeterminants. Among the important corollaries of the algorithm is the extension of the polynomial solvability of integer linear programming problems with totally unimodular constraint matrix, to integer-separable convex programming. An algorithm for finding a &egr;-accurate optimal continuous solution to the nonlinear problem that is polynomial in log(1/&egr;) and the input size and the largest subdeterminant of the constraint matrix is also presented. These developments are based on proximity results between the continuous and integral optimal solutions for problems with any nonlinear separable convex objective function. The practical feature of our algorithm is that is does not demand an explicit representation of the nonlinear function, only a polynomial number of function evaluations on a prespecified grid.