On the public citation graph
Hyperbolic 0–1 programming and query optimization in information retrieval
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1016/c2013-0-03796-6openalex-snapshot
Information Technology Research and Development
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1126/science.219.4589.1172-copenalex-snapshot
Information Technology
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asi.20745openalex-snapshot
A new measure of clustering effectiveness: Algorithms and experimental studies
inferred← citeshttps://doi.org/10.1007/978-1-4757-3532-1_3openalex-snapshot
Product Disaggregation in Global Optimization and Relaxations of Rational Programs
inferred← citeshttps://doi.org/10.1007/978-1-4939-0742-7_2openalex-snapshot
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-31963-4_5openalex-snapshot
Algorithms for WLAN Coverage Planning
inferred← citeshttps://doi.org/10.1007/bf01531072openalex-snapshot
Boolean query optimization and the 0-1 hyperbolic sum problem
inferred← citeshttps://doi.org/10.1007/bf02942391openalex-snapshot
Complexity of a particular class of single and multiple ratio quadratic 0–1 fractional programming problems
inferred← citeshttps://doi.org/10.1007/s10107-010-0431-1openalex-snapshot
Hyperbolic set covering problems with competing ground-set elements
inferred← citeshttps://doi.org/10.1007/s10288-007-0052-6openalex-snapshot
On a new class of nonlinear set covering problems arising in wireless network design
inferred← citeshttps://doi.org/10.1007/s10479-005-2048-yopenalex-snapshot
Filtering Policies in Loss Queuing Network Location Problems
inferred← citeshttps://doi.org/10.1007/s10878-005-1856-yopenalex-snapshot
Feature Selection for Consistent Biclustering via Fractional 0–1 Programming
inferred← citeshttps://doi.org/10.1007/s10878-008-9186-5openalex-snapshot
Finding checkerboard patterns via fractional 0–1 programming
inferred← citeshttps://doi.org/10.1007/s10898-004-5119-8openalex-snapshot
The Complexity of Minimum Ratio Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9832-9openalex-snapshot
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
inferred← citeshttps://doi.org/10.1007/s10898-014-0189-8openalex-snapshot
Exact solution approach for a class of nonlinear bilevel knapsack problems
inferred← citeshttps://doi.org/10.1007/s10898-016-0487-4openalex-snapshot
Fractional 0–1 programming: applications and algorithms
inferred← citeshttps://doi.org/10.1007/s10898-019-00817-7openalex-snapshot
Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations
inferred← citeshttps://doi.org/10.1007/s10898-022-01131-5openalex-snapshot
Fractional 0–1 programming and submodularity
inferred← citeshttps://doi.org/10.1007/s11155-007-9045-6openalex-snapshot
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-443-24066-9.00074-xopenalex-snapshot
Applications to biomedicine
inferred← citeshttps://doi.org/10.1016/j.dam.2012.06.010openalex-snapshot
Scheduling tasks with exponential duration on unrelated parallel machines
inferred← citeshttps://doi.org/10.1016/j.orl.2004.05.011openalex-snapshot
On complexity of unconstrained hyperbolic 0–1 programming problems
inferred← citeshttps://doi.org/10.1016/j.orl.2004.11.003openalex-snapshot
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
inferred← citeshttps://doi.org/10.1016/j.orl.2007.12.001openalex-snapshot
A strongly polynomial simplex method for the linear fractional assignment problem
inferred← citeshttps://doi.org/10.1016/j.orl.2016.03.015openalex-snapshot
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0–1 programming problems
inferred← citeshttps://doi.org/10.1016/s0165-0114(01)00078-1openalex-snapshot
Fuzzy weighted averages revisited
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00157-8openalex-snapshot
Approximation algorithms for fractional knapsack problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00905-0openalex-snapshot
The computation of the worst conditional expectation
inferred← citeshttps://doi.org/10.1016/s0966-8349(97)00011-9openalex-snapshot
Fractional location problems
inferred← citeshttps://doi.org/10.1023/a:1021043227181openalex-snapshot
Product Disaggregation in Global Optimization and Relaxations of Rational Programs
inferred← citeshttps://doi.org/10.1023/a:1021279918708openalex-snapshot
Global Optimization of 0-1 Hyperbolic Programs
inferred← citeshttps://doi.org/10.1051/ro:2006013openalex-snapshot
Solution of a fractional combinatorial optimization problem by mixed integer programming
inferred← citeshttps://doi.org/10.1080/02331930600819613openalex-snapshot
A sixth bibliography of fractional programming
inferred← citeshttps://doi.org/10.1080/02331939908844438openalex-snapshot
A fifth bibliography of fractional programming*
inferred← citeshttps://doi.org/10.1080/10170660209509198openalex-snapshot
LINEAR-TIME ALGORITHM FOR THE FUZZY WEIGHTED AVERAGE METHOD
inferred← citeshttps://doi.org/10.1109/fuzzy.2008.4630496openalex-snapshot
Estimating variance under interval and fuzzy uncertainty: Parallel algorithms
inferred← citeshttps://doi.org/10.1109/icc.2004.1312476openalex-snapshot
Optimizing WLAN radio coverage
inferred← citeshttps://doi.org/10.1109/nafips.2007.383904openalex-snapshot
Computing Statistical Characteristics When We Know Probabilities with Interval or Fuzzy Uncertainty: Computational Complexity
inferred← citeshttps://doi.org/10.1109/scan.2006.45openalex-snapshot
Towards Combining Probabilistic, Interval, Fuzzy Uncertainty, and Constraints: An Example Using the Inverse Problem in Geophysics
inferred← citeshttps://doi.org/10.1109/tfuzz.2006.878253openalex-snapshot
A Comparison of Discrete Algorithms for Fuzzy Weighted Average
inferred← citeshttps://doi.org/10.1109/tnet.2007.896478openalex-snapshot
Radio Planning of Wireless Local Area Networks
inferred← citeshttps://doi.org/10.1109/tpami.2009.75openalex-snapshot
Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm
inferred← citeshttps://doi.org/10.1109/vetecs.2004.1390668openalex-snapshot
WLAN coverage planning: optimization models and algorithms
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.188openalex-snapshot
Database Keyword Search: A Perspective from Optimization
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0025openalex-snapshot
On Robust Fractional 0-1 Programming
inferred← citeshttps://doi.org/10.1287/mnsc.44.3.311openalex-snapshot
Admission Policies in Loss Queueing Models with Heterogeneous Arrivals
inferred← citeshttps://doi.org/10.1287/opre.1080.0567openalex-snapshot
A Column Generation Algorithm for Choice-Based Network Revenue Management
inferred← citeshttps://doi.org/10.1287/opre.1100.0897openalex-snapshot
Solving Nonlinear Covering Problems Arising in WLAN Design
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07235openalex-snapshot
Fractional 0-1 programming and submodularity
inferred← citeshttps://doi.org/10.6148/ijitas.2010.0301.05openalex-snapshot
Estimating Risk under Interval Uncertainty: Sequential and Parallel Algorithms
inferred← citeshttps://doi.org/10.70675/f486f39ezdf04z4f7fzacc1z04d430801842openalex-snapshot
Analyse formelle de concepts et fusion d'informations : application à l'estimation et au contrôle d'incertitude des indicateurs agri-environnementaux
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.