Boolean query optimization and the 0-1 hyperbolic sum problem
From MaRDI portal
Publication:1356211
DOI10.1007/BF01531072zbMath0870.68048OpenAlexW1981672946MaRDI QIDQ1356211
Pierre Hansen, Marcus V. Poggi de Aragão, Celso Carneiro Ribeiro
Publication date: 20 July 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531072
Related Items (12)
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 programming: applications and algorithms ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ On a new class of nonlinear set covering problems arising in wireless network design ⋮ Pseudo-Boolean optimization ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ 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 ⋮ The maximum capture problem with random utilities: problem formulation and algorithms
Cites Work
- Optimization by Simulated Annealing
- Algorithms for the maximum satisfiability problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- The tabu search metaheuristic: How we used it
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- Tabu Search—Part II
- Unnamed Item
This page was built for publication: Boolean query optimization and the 0-1 hyperbolic sum problem
