On search over rationals
type: Item
instance of: scholarly article
title: On search over rationals
zbMATH Open document ID: 0497.65036
DOI: 10.1016/0167-6377(81)90023-7
author: Eitan Zemel
published in: Operations Research Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 3784218
zbMATH Keywords: ratio functions
zbMATH Keywords: location problems
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: search over rationals
zbMATH Keywords: combinatorial programming
MaRDI profile type: Publication
full work available at URL: 0167-6377(81)90023-7
OpenAlex ID: W2009409317
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Minimal ratio spanning trees
cites work: An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
cites work: Q3901005
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Q4197641
cites work: Q4130999
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: Efficient search for rationals
cites work: Rational search
cites work: Locating Centers on a Tree with Discontinuous Supply and Demand Regions
cites work: The Linear Multiple Choice Knapsack Problem
cites work: Polynomial algorithms for estimating network reliability
description: scientific article; zbMATH DE number 3784218