Cutting-plane algorithms and solution whitening for the vertex-cover problem.

@article{Claussen2022CuttingplaneAA,
  title={Cutting-plane algorithms and solution whitening for the vertex-cover problem.},
  author={Gunnar Claussen and Alexander K. Hartmann},
  journal={Physical review. E},
  year={2022},
  volume={106 3-2},
  pages={
          035305
        }
}
The phase-transition behavior of the NP-hard vertex-cover (VC) combinatorial optimization problem is studied numerically by linear programming (LP) on ensembles of random graphs. As the basic Simplex (SX) algorithm suitable for such LPs may produce incomplete solutions for sufficiently complex graphs, the application of cutting-plane (CP) methods is sought. We consider Gomory and {0,1/2} cuts. We measure the probability of obtaining complete solutions with these approaches as a function of the… 

Figures from this paper

References

SHOWING 1-10 OF 44 REFERENCES

Algorithms column: the vertex cover problem

A slightly simpler proof of an old result by Nemhauser and Trotter of the Weighted Vertex Cover problem, where Xu refers to a binary indicator variable, and its value is 1 if and only if vertex u is in the cover.

Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming

It is demonstrated that the technique leads to one simple-to-understand transition for the well known 2-SAT problem and that the hardness transitions are not driven by changes of any of various standard percolation or solution space properties of the problem instances.

Lexicography and degeneracy: can a pure cutting plane algorithm work?

An implementation of the lexicographic version of Gomory’s fractional cutting plane method for ILP problems and of two heuristics mimicking the latter are discussed, and the exact solution of ILP instances from MIPLIB such as stein15, stein27, and bm23 is reported.

Circumspect descent prevails in solving random constraint satisfaction problems

It is shown by extensive numerical investigations that ChainSAT and other focused algorithms solve large K-SAT instances almost surely in linear time, up to high clause-to-variable ratios α; for example, for K = 4 the authors observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space.

Phase coexistence and finite size scaling in random combinatorial problems

We study an exactly solvable version of the well known random Boolean satisfiability (SAT) problem, the so-called random XOR-SAT problem. Rare events are shown to affect the combinatorial `phase

The large deviations of the whitening process in random constraint satisfaction problems

A large deviation study of the dynamics of a stripping process (whitening) that unveils the frozen variables of a solution, building upon recent works on atypical trajectories of the bootstrap percolation dynamics.

Analytic and Algorithmic Solution of Random Satisfiability Problems

A class of optimization algorithms that can deal with the proliferation of metastable states are introduced; one such algorithm has been tested successfully on the largest existing benchmark of K-satisfiability.

Core percolation in random graphs: a critical phenomena analysis

Abstract:We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf

A new look at survey propagation and its generalizations

The experimental results show that message-passing on a novel family of Markov random fields is most effective for values of ρ ≠ 1 (i.e., distinct from survey propagation), and suggest that random formulas may not typically possess non-trivial cores.

Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics

This book focuses on combinatorial optimization using statistical physics, and on the development of new, statistical-mechanics motivated algorithms for this purpose.