Pages that link to "Item:Q1356211"
From MaRDI portal
The following pages link to Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211):
Displaying 15 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- On a new class of nonlinear set covering problems arising in wireless network design (Q941005) (← links)
- Hyperbolic 0-1 programming and query optimization in information retrieval (Q1181735) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Mathematical Optimization Models for WLAN Planning (Q3404474) (← links)
- Solution of a fractional combinatorial optimization problem by mixed integer programming (Q3411295) (← links)
- (Q5005186) (← links)
- Recent Findings in Boolean Techniques (Q5856082) (← links)