Redirigiendo al acceso original de articulo en 22 segundos...
ARTÍCULO
TITULO

Problems of discrete optimization with quasiblock matrices

D.V Lemtyuzhnikova    
D.V. Kovkov    

Resumen

We consider algorithms for solving integer optimization problems with quasi--block structure. Modern decomposition approaches are analyzed. We study Finkelstein decomposition and it variations for discovering quasi--block structure. Efficiency of local elimination algorithm for large-scale problem is analyzed. Specific details of application of parametric optimization are provided. Dependency of order of solving subproblems on the algorithm performance is studied. We provide results of numerical experiments for solving large--scale linear programming problems by exact, approximate, or heuristic algorithms. Also we present experiments for parallelization of local elimination algorithm using grid computing approach. We discuss some problems which cannot be solved efficiently without parallelization techniques.

 Artículos similares

       
 
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz    
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca... ver más
Revista: Algorithms

 
Violeta Migallón and José Penadés    
Graph theory is a common topic that is introduced as part of the curricula of computing courses such as Computer Science, Computer Engineering, Data Science, Information Technology and Software Engineering. Understanding graphs is fundamental for solving... ver más
Revista: Applied Sciences

 
Yujie Wei, Hongpeng Zhang, Yuan Wang and Changqiang Huang    
Maneuver decision-making is essential for autonomous air combat. However, previous methods usually make decisions to aim at the target instead of hitting the target and use discrete action spaces instead of continuous action spaces. While these simplific... ver más
Revista: Applied Sciences

 
Vyacheslav I. Yukalov and Elizaveta P. Yukalova    
The dynamics of affective decision making is considered for an intelligent network composed of agents with different types of memory: long-term and short-term memory. The consideration is based on probabilistic affective decision theory, which takes into... ver más
Revista: Algorithms

 
Ahmed El-Mesady, Aleksandr Y. Romanov, Aleksandr A. Amerikanov and Alexander D. Ivannikov    
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cell... ver más
Revista: Algorithms