Cover Image

Метод обчислення дельта-складових зі складністю O(1) в квадратичній задачі про призначення

The quadratic assignment problem is rightfully considered to be one of the most challenging problems of combinatorial optimization. Since this problem is NP-hard, the use of heuristic algorithms is the only way to find in a reasonable time a solution that is close to optimal. One of the most effecti...

Full description

Saved in:
Bibliographic Details
Date:2015
Main Authors: Podolsky, S. V., Zorin, Yu. M.
Format: Article
Language:English
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2015
Online Access:http://journal.iasa.kpi.ua/article/view/52086
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:System research and information technologies

Institution

System research and information technologies

Similar Items

Similar Items