Boolean query optimization and the 0-1 hyperbolic sum problem
From MaRDI portal
Recommendations
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- scientific article; zbMATH DE number 7378399
- Bounded queries, approximations, and the Boolean hierarchy
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
- scientific article; zbMATH DE number 38107
- On approximability of Boolean formula minimization
- Principles and Practice of Constraint Programming – CP 2004
- Optimization, randomized approximability, and Boolean constraint satisfaction problems
- Satisfiability-based algorithms for Boolean optimization
- Boolean lexicographic optimization: algorithms \& applications
Cites work
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Algorithms for the maximum satisfiability problem
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Optimization by simulated annealing
- Tabu Search—Part I
- Tabu Search—Part II
- The tabu search metaheuristic: How we used it
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(16)- Hyperbolic 0-1 programming and query optimization in information retrieval
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- On complexity of unconstrained hyperbolic 0--1 programming problems
- The maximum capture problem with random utilities: problem formulation and algorithms
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
- Fractional 0-1 programming and submodularity
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Mathematical optimization models for WLAN planning
- Solution of a fractional combinatorial optimization problem by mixed integer programming
- scientific article; zbMATH DE number 7378399 (Why is no real title available?)
- Recent Findings in Boolean Techniques
- Convexification techniques for fractional programs
- Pseudo-Boolean optimization
- Hyperbolic set covering problems with competing ground-set elements
- On a new class of nonlinear set covering problems arising in wireless network design
This page was built for publication: Boolean query optimization and the 0-1 hyperbolic sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356211)
