Restructuring in Combinatorial Optimization
Data Structures and Algorithms
2011-02-10 v1 Artificial Intelligence
Combinatorics
Optimization and Control
Abstract
The paper addresses a new class of combinatorial problems which consist in restructuring of solutions (as structures) in combinatorial optimization. Two main features of the restructuring process are examined: (i) a cost of the restructuring, (ii) a closeness to a goal solution. This problem corresponds to redesign (improvement, upgrade) of modular systems or solutions. The restructuring approach is described and illustrated for the following combinatorial optimization problems: knapsack problem, multiple choice problem, assignment problem, spanning tree problems. Examples illustrate the restructuring processes.
Cite
@article{arxiv.1102.1745,
title = {Restructuring in Combinatorial Optimization},
author = {Mark Sh. Levin},
journal= {arXiv preprint arXiv:1102.1745},
year = {2011}
}
Comments
11 pages, 12 figures