Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Information Processing Letters
Simple local search problems that are hard to solve
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Handbook of combinatorics (vol. 2)
On the complexity of postoptimality analysis of 0/1 programs
Discrete Applied Mathematics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
0/1-Integer Programming: Optimization and Augmentation are Equivalent
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximate Local Search in Combinatorial Optimization
SIAM Journal on Computing
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Structure in locally optimal solutions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Calculation of stability radii for combinatorial optimization problems
Operations Research Letters
Domination analysis of algorithms for bipartite boolean quadratic programs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
We show that if one can find the optimal value of an integer linear programming problem in polynomial time, then one can find an optimal solution in polynomial time. We also present a proper generalization to (general) integer programs and to local search problems of the well-known result that optimization and augmentation are equivalent for 0/1-integer programs. Among other things, our results imply that PLS-complete problems cannot have "near-exact" neighborhoods, unless PLS = P.