Pages that link to "Item:Q1977758"
From MaRDI portal
The following pages link to Guided local search for solving SAT and weighted MAX-SAT problems (Q1977758):
Displaying 19 items.
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Applying an extended guided local search to the quadratic assignment problem (Q1861943) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- Learning MAX-SAT from contextual examples for combinatorial optimisation (Q2680761) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Guided local search for solving SAT and weighted MAX-SAT problems (Q2749855) (← links)
- Guided local search joins the elite in discrete optimisation (Q2751577) (← links)
- Template design under demand uncertainty by integer linear local search (Q3430258) (← links)
- Neighbourhood Clause Weight Redistribution in Local Search for SAT (Q3524223) (← links)
- (Q4637032) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- FITNESS LANDSCAPES AND THE ANDREWS–CURTIS CONJECTURE (Q5389109) (← links)
