Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Journal of combinatorial optimization

• Publication date

  1999-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1009873324187
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

  2001cited by this paper
• Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT

  1998cited by this paper
• Variable-Selection Heuristics in Local Search for SAT

  1997cited by this paper
• Local Search Algorithms for Partial MAXSAT

  1997cited by this paper
• Tabu Search for SAT

  1997cited by this paper
• A Parallel GRASP for MAX-SAT Problems

  1996cited by this paper
• Approximate solution of weighted MAX-SAT problems using GRASP

  1996cited by this paper
• Noise Strategies for Improving Local Search

  1994cited by this paper
• Towards an Understanding of Hill-Climbing Procedures for SAT

  1993cited by this paper
• An Empirical Study of Greedy Local Search for Satisfiability Testing

  1993cited by this paper
• Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems

  1993cited by this paper
• Local search strategies for satisfiability testing

  1993cited by this paper
• A New Method for Solving Hard Satis ability Problems

  1992cited by this paper
• Efficient local search for very large-scale satisfiability problems

  1992cited by this paper
• The art of computer programming

  1983cited by this paper
• Storing a sparse table with O(1) worst case access time

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper

• Hybrid Heuristic Algorithms for Adiabatic Quantum Machine Learning Models

  2024cites this paper
• Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems

  2024cites this paper
• An Efficient Closed-Form Formula for Evaluating r-Flip Moves in Quadratic Unconstrained Binary Optimization

  2023cites this paper
• On the Smoothed Complexity of Combinatorial Local Search

  2022cites this paper
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints

  2021cites this paper
• On efficient testing of capacity constraints in pickup-and-delivery problems with trailers

  2020cites this paper
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints

  2017cites this paper
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs

  2016cites this paper
• Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems

  2015cites this paper
• Recent progress of local search in handling the time window constraints of the vehicle routing problem

  2013cites this paper
• Recent progress of local search in handling the time window constraints of the vehicle routing problem

  2013cites this paper
• A Multilevel Tabu Search for the Maximum Satisfiability Problem

  2012cites this paper
• Global Equilibrium Search Algorithms for Combinatorial Optimization Problems

  2012cites this paper
• The Parameterized Complexity of K-flip Local Search for Sat and Max Sat the Parameterized Complexity of K-flip Local Search for Sat and Max Sat

  2011cites this paper
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT

  2011cites this paper
• Efficient local search algorithms for the linear ordering problem

  2010cites this paper
• Recent progress of local search in handling the time window constraints of the vehicle routing problem

  2010cites this paper
• Theorems Supporting r-flip Search for Pseudo-Boolean Optimization

  2010cites this paper
• The parameterized complexity of k-flip local search for SAT and MAX SAT

  2009cites this paper
• Solving weighted MAX-SAT via global equilibrium search

  2008cites this paper
• Weight Redistribution for Unweighted MAX-SAT

  2007cites this paper
• Metaheuristic algorithms for combinatorial optimization problems

  2005cites this paper
• Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT

  2003cites this paper
• A review of the literature on local search algorithms for MAX-SAT

  2001cites this paper
• Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

  2001influential citation
• On metaheuristic algorithms for combinatorial optimization problems

  2001cites this paper
• Studies on metaheuristic algorithms for combinatorial optimization problems

  1999cites this paper