Results 1 to 10 of about 1,967,671 (302)
A decade of combinatorial optimization. [PDF]
, 1997 This paper offers a brief overview of the developments in combinatorial optimization during the past decade. We discuss improvements in polynomial-time algorithms for problems on graphs and networks, and review the methodological and computational progress in linear and integer optimization.
Aardal, K. +3 more
openaire +10 more sources
Applied Computational Intelligence and Soft ComputingMetaheuristic algorithms reduce the size of combinatorial test suites, lowering testing costs. Researchers have developed several combinatorial test suite generators in the literature that adopt metaheuristic algorithms, such as particle swarm ...
Anjila J. Suali +6 more
doaj +1 more source
Nuevas técnicas de particionamiento en clasificación automática
Revista de Matemática: Teoría y Aplicaciones, 2009 In this article there are exposed some new thechniques for hte search of global optima inthe partitioning problem in Cluster Analysis. With these thechniques the results are sensibly improved with respect to the traditional methods. The methods developed
Eduardo Piza Volio +2 more
doaj +1 more source
Combinatorial optimization in geometry
Advances in Applied Mathematics, 2003 27 pages, 1996 ...
openaire +2 more sources
Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]
Jisuanji kexue yu tansuoIn order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj +1 more source
Engineering Science and Technology, an International Journal, 2016 This paper presents a technique to minimize the number of test cases in configuration-aware structural testing. Combinatorial optimization is used first to generate an optimized test suite by sampling the input configuration.
Bestoun S. Ahmed
doaj +1 more source
State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems
IEEE Access, 2019 A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure.
Xiaoxia Han +3 more
doaj +1 more source
A General Combinatorial Ant System-based Distributed Routing Algorithm for Communication Networks [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 In this paper, a general Combinatorial Ant System-based distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented.
Jose Aguilar, Miguel Labrador
doaj
Combinatorial optimization with quantum computers
Engineering OptimizationQuantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one operator to the input, a quantum computer can apply the operator to a superposition of binary strings to provide ...
Chicano, Francisco +3 more
openaire +3 more sources
COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY AND FORMAL MODELS OF EXPERT ESTIMATION
Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, 2019 Previously, the author formalized the concepts of uncertainty, compromise solution, compromise criteria and conditions for a quite general class of combinatorial optimization problems.
Alexander Anatolievich Pavlov
doaj +1 more source