Local search starting from an LP solution: Fast and quite good

Authors:
Alaubek Avdil;Karsten Weihe
Affiliations:
Technische Universität Darmstadt, Germany;Technische Universität Darmstadt, Germany
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2010

Citing 33
Cited 0

Optimization, approximation, and complexity classes

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Algorithms for the maximum satisfiability problem

Computing
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

Discrete Mathematics
Combinatorial properties and complexity of a max-cut approximation

European Journal of Combinatorics
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Laplacian eigenvalues and the maximum cut problem

Mathematical Programming: Series A and B
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Generating hard satisfiability problems

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Design and performance of parallel and distributed approximation algorithms for Maxcut

Journal of Parallel and Distributed Computing
Variable neighborhood search

Computers and Operations Research
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Cross-entropy and rare events for maximal cut and partition problems

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
A Spectral Bundle Method for Semidefinite Programming

SIAM Journal on Optimization
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

Journal of Automated Reasoning
LP-Based Heuristic Algorithms for Interconnecting Token Rings viaSource Routing Bridges

Journal of Heuristics
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Parallel GRASP for MAX-SAT Problems

PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Gadgets Approximation, and Linear Programming

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
An improved hybrid genetic algorithm for the generalized assignment problem

Proceedings of the 2004 ACM symposium on Applied computing
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A low-level hybridization between memetic algorithm and VNS for the max-cut problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Random MAX SAT, random MAX CUT, and their phase transitions

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
An LP-based heuristic procedure for the generalized assignment problem with special ordered sets

Computers and Operations Research
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and evaluate a specific way to generate good start solutions for local search. The start solution is computed from a certain LP, which is related to the underlying problem. We consider three optimization problems: the directed MAX-CUT problem with a source and a sink and two variations of the MAX-k-SAT problem with k = 2 and k = 3. To compare our technique, we run local search repeatedly with random start solutions. Our technique produces, consistently, final solutions whose objective values are not too far from the best solutions from repeated random starts. The surprising degree of stability and uniformity of this result throughout all of our experiments on various classes of instances strongly suggests that we have consistently achieved nearly optimal solutions. On the other hand, the runtime of our technique is rather small, so the technique is very efficient and probably quite accurate.