Pages that link to "Item:Q753502"
From MaRDI portal
The following pages link to Algorithms for the maximum satisfiability problem (Q753502):
Displaying 50 items.
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- A finite state intersection approach to propositional satisfiability (Q442157) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A fixed point operator for the generalised maximum satisfiability problem (Q689970) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- A theoretical analysis of the cross-nested logit model (Q867562) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- Probabilistic estimates for the generalized maximum satisfiability problem (Q1327226) (← links)
- A tabu search algorithm for computing an operational timetable (Q1331550) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- The tabu search metaheuristic: How we used it (Q1356212) (← links)
- Variable neighborhood search (Q1374041) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Algorithmic approach to the satisfactory graph partitioning problem (Q1580976) (← links)
- Global optimization for artificial neural networks: A tabu search application (Q1609919) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Boolean regression (Q1904716) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
- Heuristic reliability optimization by tabu search (Q1919847) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (Q2209555) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
