Local search starting from an LP solution

DOI10.1145/1498698.1594877zbMATH Open1284.68221OpenAlexW1997279853MaRDI QIDQ5406199

Alaubek Avdil, Karsten Weihe

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1594877

zbMATH Keywords

combinatorial optimizationlocal searchheuristichybrid algorithmspolyhedral combinatoricsMax-SATMax-CutMax-\(k\)-SAT

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Local search starting from an LP solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406199)