On the public citation graph
Boolean query optimization and the 0-1 hyperbolic sum problem
0 signed · 40 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/bf00940812openalex-snapshot
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
inferredcites →https://doi.org/10.1007/bf01531073openalex-snapshot
The tabu search metaheuristic: How we used it
inferredcites →https://doi.org/10.1007/bf01582890openalex-snapshot
Hyperbolic 0–1 programming and query optimization in information retrieval
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0306-4573(88)90094-5openalex-snapshot
A simple blueprint for automatic Boolean query processing
inferredcites →https://doi.org/10.1016/0306-4573(88)90098-2openalex-snapshot
A logic assistant for the database searcher
inferredcites →https://doi.org/10.1016/0377-2217(84)90231-5openalex-snapshot
A thermodynamically motivated simulation procedure for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1111/j.1467-9574.1989.tb01245.xopenalex-snapshot
Simulated annealing: An introduction
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_11openalex-snapshot
Mathematical Optimization Models for WLAN Planning
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/s10107-024-02131-xopenalex-snapshot
Convexification techniques for fractional programs
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/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.1016/j.dam.2004.06.006openalex-snapshot
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
inferred← citeshttps://doi.org/10.1016/j.omega.2019.06.009openalex-snapshot
Assortment optimisation problem: A distribution-free approach
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.2016.03.015openalex-snapshot
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0–1 programming problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00340-xopenalex-snapshot
The maximum capture problem with random utilities: Problem formulation and algorithms
inferred← citeshttps://doi.org/10.1023/a:1009670031749openalex-snapshot
Query Optimization in Distributed Relational Databases
inferred← citeshttps://doi.org/10.1051/ro/1994280303031openalex-snapshot
A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
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.1093/bioinformatics/btt532openalex-snapshot
Discovering combinatorial interactions in survival data
inferred← citeshttps://doi.org/10.1109/icc.2004.1312476openalex-snapshot
Optimizing WLAN radio coverage
inferred← citeshttps://doi.org/10.1109/tnet.2007.896478openalex-snapshot
Radio Planning of Wireless Local Area Networks
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0025openalex-snapshot
On Robust Fractional 0-1 Programming
inferred← citeshttps://doi.org/10.1287/opre.1100.0897openalex-snapshot
Solving Nonlinear Covering Problems Arising in WLAN Design
inferred← citeshttps://doi.org/10.24200/sci.2018.51736.2337openalex-snapshot
A Mathematical Model for Competitive Location Problem with Product Selection
inferred← citeshttps://doi.org/10.3390/math9151768openalex-snapshot
The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession
inferred← citeshttps://doi.org/10.48550/arxiv.2012.07235openalex-snapshot
Fractional 0-1 programming and submodularity
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.