Hyperbolic 0-1 programming and query optimization in information retrieval

DOI10.1007/BF01582890MaRDI QIDQ1181735zbMATH OpenFDO

Authors Marcus V. Poggi de Aragão, Pierre Hansen, Celso C. Ribeiro

Publication date 27 June 1992

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

information retrievalquery optimizationunconstrained hyperbolic \(0-1\) programming

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Fractional programming (90C32) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Recommendations

• Boolean query optimization and the 0-1 hyperbolic sum problem
• On complexity of unconstrained hyperbolic 0--1 programming problems
• scientific article; zbMATH DE number 2190133
• Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
• Global optimization of 0-1 hyperbolic programs

Cites work

• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Time bounds for selection

Cited in

(22)

• Solution of a fractional combinatorial optimization problem by mixed integer programming
• Feature selection for consistent biclustering via fractional 0-1 programming
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
• Scheduling tasks with exponential duration on unrelated parallel machines
• Fractional 0-1 programming: applications and algorithms
• The computation of the worst conditional expectation.
• Finding checkerboard patterns via fractional 0-1 programming
• Fuzzy weighted averages revisited
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• Computing population variance and entropy under interval uncertainty: Linear-time algorithms
• Fractional 0-1 programming and submodularity
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
• Approximation algorithms for fractional knapsack problems
• On complexity of unconstrained hyperbolic 0--1 programming problems
• A strongly polynomial simplex method for the linear fractional assignment problem
• On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
• A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• The complexity of minimum ratio spanning tree problems
• A fifth bibliography of fractional programming^*
• Hyperbolic set covering problems with competing ground-set elements
• Filtering policies in loss queueing network location problems

This page was built for publication: Hyperbolic 0-1 programming and query optimization in information retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181735)