Results 11 to 20 of about 4,919,639 (299)
Combinatorial Problems in OpenAD [PDF]
, 2012 Computing derivatives using automatic differentiation methods entails a variety of combinatorial problems. The OpenAD tool implements automatic differentiation as source transformation of a program that represents a numerical model. We select three combinatorial problems and discuss the solutions implemented in OpenAD.
Utke, Jean, Naumann, Uwe
openaire +6 more sources
Journal of Telecommunications and Information Technology, 2023 This paper presents a new procedure for computing the set of supported non-dominated solutions of bi-criteria minimum spanning tree problems in ordered manner.
Carlos Gomes da Silva +1 more
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
Multiobjective combinatorial optimization problems: social, keywords, and journal maps
, 2022 Multiobjective combinatorial optimization problems appear in a wide range of applications including operations research/management, engineering, biological sciences, and computer science.
Siamak Talatahari +7 more
core +1 more source
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
Algorithm portfolio based scheme for dynamic optimization problems [PDF]
International Journal of Computational Intelligence Systems, 2015 Since their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems. Nevertheless and despite that success, they have not received much attention in Dynamic Optimization ...
Jenny Fajardo Calderín +2 more
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
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
Combinatorial representations [PDF]
, 2011 23pp. Submitted to J. Combinatorial Theory (Series A)arXiv:1109.1216v1 [math.CO]23pp. Submitted to J. Combinatorial Theory (Series A)23pp. Submitted to J.
Maximilien Gadouleau +10 more
core +1 more source
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A +3 more
core +5 more sources