Pages that link to "Item:Q1613279"
From MaRDI portal
The following pages link to An algorithm based on tabu search for satisfiability problem (Q1613279):
Displaying 10 items.
- Tabu search for the real-world carpooling problem (Q306096) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- Using Tabu Search in CSPs (Q2704403) (← links)
- An artificial bee colony algorithm for solving SAT problem (Q2927033) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Algorithmic Applications in Management (Q5710128) (← links)