Combinatorial Optimization with Rational Objective Functions: A Communication
- 1 May 1983
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 8 (2) , 314
- https://doi.org/10.1287/moor.8.2.314
Abstract
Megiddo (Megiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 414–424.) has proposed an algorithm to solve a class of combinatorial optimization problems with rational objective functions in polynomial time. The minimum ratio path problem is claimed to be one such problem. This claim is not correct as indicated below.Keywords
This publication has 0 references indexed in Scilit: