Geometric Algorithms for Linear Programming

Hiroshi IMAI

Copy

Hiroshi IMAI, "Geometric Algorithms for Linear Programming" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 3, pp. 259-264, March 1993, doi: .
Abstract: Two computational-geometric approaches to linear programming are surveyed. One is based on the prune-and-search paradigm and the other utilizes randomization. These two techniques are quite useful to solve geometric problems efficiently, and have many other applications, some of which are also mentioned.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e76-a_3_259/_p

Copy

@ARTICLE{e76-a_3_259,
author={Hiroshi IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Geometric Algorithms for Linear Programming},
year={1993},
volume={E76-A},
number={3},
pages={259-264},
abstract={Two computational-geometric approaches to linear programming are surveyed. One is based on the prune-and-search paradigm and the other utilizes randomization. These two techniques are quite useful to solve geometric problems efficiently, and have many other applications, some of which are also mentioned.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Geometric Algorithms for Linear Programming
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 259
EP - 264
AU - Hiroshi IMAI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1993
AB - Two computational-geometric approaches to linear programming are surveyed. One is based on the prune-and-search paradigm and the other utilizes randomization. These two techniques are quite useful to solve geometric problems efficiently, and have many other applications, some of which are also mentioned.
ER -