Results 11 to 20 of about 28,166 (165)
Central partition for a partition-distance and strong pattern graph
Revstat Statistical Journal, 2004 When several clustering algorithms are applied to a dataset E or the same algorithm with different parameters, we get several different partitions of the dataset.
Joaquim F. Pinto da Costa , P.R. Rao
doaj +1 more source
The Combinatorial ANT System for Dynamic Combinatorial Optimization Problems
Revista de Matemática: Teoría y Aplicaciones, 2012 En este articulo es presentado un algoritmo distribuido basado en conceptos de los Sistemas de Hormiga, llamado Sistema Combinatorio de Hormigas, para resolver problemas de optimización combinatoria dinámicos.
Jose Aguilar
doaj +1 more source
On the Strong Equitable Vertex 2-Arboricity of Complete Bipartite Graphs
Mathematics, 2020 An equitable partition of a graph G is a partition of the vertex set of G such that the sizes of any two parts differ by at most one. The strong equitable vertexk-arboricity of G, denoted by vak≡(G), is the smallest integer t such that G can be equitably
Fangyun Tao, Ting Jin, Yiyou Tu
doaj +1 more source
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Frontiers in Physics, 2022 Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems.
Tianyi Hao +5 more
doaj +1 more source
Dynamical System-Based Computational Models for Solving Combinatorial Optimization on Hypergraphs
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2023 The intrinsic energy minimization in dynamical systems offers a valuable tool for minimizing the objective functions of computationally challenging problems in combinatorial optimization. However, most prior works have focused on mapping such dynamics to
Mohammad Khairul Bashar +3 more
doaj +1 more source
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem.
Cigdem Alabas-Uslu, Berna Dengiz
doaj +1 more source
Mathematics, 2021 Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been ...
Md Ashikur Rahman +5 more
doaj +1 more source
On Some Optimization Problems on Permutations
Кібернетика та комп'ютерні технології, 2022 Numerous studies consider combinatorial optimization problems and their solution methods, since a large number of practical problems are described by means of combinatorial optimization models.
Georgy Donets, Vasyl Biletskyi
doaj +1 more source
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Applications of Modelling and Simulation, 2023 The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan +4 more
doaj
Quantum computational phase transition in combinatorial problems
npj Quantum Information, 2022 Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers.
Bingzhi Zhang, Akira Sone, Quntao Zhuang
doaj +1 more source