Hyperbolic set covering problems with competing ground-set elements
From MaRDI portal
Recommendations
- On a new class of nonlinear set covering problems arising in wireless network design
- Solving nonlinear covering problems arising in WLAN design
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- scientific article; zbMATH DE number 3863198
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
Cites work
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A fast approximation algorithm for the multicovering problem
- A Greedy Heuristic for the Set-Covering Problem
- A threshold of ln n for approximating set cover
- Approximation schemes for covering and packing problems in image processing and VLSI
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Global optimization of 0-1 hyperbolic programs
- scientific article; zbMATH DE number 1670809 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1253041 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 1175963 (Why is no real title available?)
- scientific article; zbMATH DE number 915574 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Hyperbolic 0-1 programming and query optimization in information retrieval
- On a new class of nonlinear set covering problems arising in wireless network design
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Optimal packing and covering in the plane are NP-complete
- Set Partitioning: A survey
Cited in
(5)- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Compact representations of all members of an independence system
- On a new class of nonlinear set covering problems arising in wireless network design
This page was built for publication: Hyperbolic set covering problems with competing ground-set elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715069)
