Pages that link to "Item:Q1304388"

The following pages link to Analyses on the 2 and 3-flip neighborhoods for the MAX SAT (Q1304388):

Displaying 12 items.

• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
• Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation (Q1850970) (← links)
• Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
• Efficient local search algorithms for the linear ordering problem (Q3002554) (← links)
• The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)