On search over rationals

DOI10.1016/0167-6377(81)90023-7zbMath0497.65036OpenAlexW2009409317MaRDI QIDQ1170866

Eitan Zemel

Publication date: 1981

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(81)90023-7

zbMATH Keywords

location problemspolynomial algorithmcombinatorial programmingratio functionssearch over rationals

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Fractional programming (90C32)

Related Items (7)

Efficient algorithms for center problems in cactus networks ⋮ Operations research applications of dichotomous search ⋮ Uniqueness in quadratic and hyperbolic \(0-1\) programming problems ⋮ Optimal search for rationals ⋮ An O(n) algorithm for the linear multiple choice knapsack problem and related problems ⋮ Locating two obnoxious facilities using the weighted maximin criterion ⋮ Bibliography in fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• Rational search
• Efficient search for rationals
• Combinatorial Optimization with Rational Objective Functions
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The Linear Multiple Choice Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Polynomial algorithms for estimating network reliability
• An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• Minimal ratio spanning trees
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $

This page was built for publication: On search over rationals