Hyperbolic set covering problems with competing ground-set elements
DOI10.1007/S10107-010-0431-1zbMATH Open1254.90119OpenAlexW2028120800MaRDI QIDQ715069FDOQ715069
E. Amaldi, Federico Malucelli, Sandro Bosio
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0431-1
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
complexitywireless networksset coveringLagrangean relaxationoverlapsapproximabilityhyperbolic objective function
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10)
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- A Greedy Heuristic for the Set-Covering Problem
- Title not available (Why is that?)
- A fast approximation algorithm for the multicovering problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- Title not available (Why is that?)
- On a new class of nonlinear set covering problems arising in wireless network design
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation schemes for covering and packing problems in image processing and VLSI
- Set Partitioning: A survey
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Optimal packing and covering in the plane are NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Global optimization of 0-1 hyperbolic programs
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cited In (4)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Compact representations of all members of an independence system
Uses Software
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)
