Parametrical Approach for Bilinear Programming and its Application for solving Integer and Combinatorial Optimization Problems

Dmitrii Lozovanu

Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova

Аннотация: A parametrical approach for bilinear programming is proposed and new algorithms on the basis of such approach for solving linear boolean and resource allocation problems are developed. Computational complexity of the proposed algorithms is discussed.

Ключевые слова и фразы: Integer programming, computational complexity.

MSC: 65K05, 68W25

Поступила в редакцию: 20.09.2007

Язык публикации: английский

Реферативные базы данных:

• 
•