Results 21 to 30 of about 3,624,996 (285)
Adaptive Cut Selection in Mixed-Integer Linear Programming
Open Journal of Mathematical Optimization, 2023 Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance.
Turner, Mark +3 more
doaj +1 more source
Space truss structures’ optimization using metaheuristic optimization algorithms
, 2023 Metaheuristic optimization algorithms are popular tools for solving engineering optimization problems. In this chapter, space truss structures are optimized using three population-based metaheuristic algorithms: African Vulture Optimization Algorithm ...
Mirjalili, S +7 more
core +1 more source
Detection number of bipartite graphs and cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 For a connected graph G of order |V(G)| ≥3 and a k-labelling c : E(G) →{1,2,…,k} of the edges of G, the code of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are labelled i. The k-labelling c is
Frederic Havet +2 more
doaj +1 more source
Progress in mathematical programming solvers from 2001 to 2020
EURO Journal on Computational Optimization, 2022 This study investigates the progress made in lp and milp solver performance during the last two decades by comparing the solver software from the beginning of the millennium with the codes available today.
Thorsten Koch +3 more
doaj +1 more source
A method for eternally dominating strong grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex.
Alizée Gagnon +7 more
doaj +1 more source
Optimization of material distribution for forged automotive components using hybrid optimization techniques [PDF]
Computer Methods in Materials Science, 2021 The paper deals with the problem of optimal material distribution inside the provided design area. Optimization based on deterministic and stochastic algorithms is used to obtain the best result on the basis of the proposed objective function and ...
Przemysław Sebastjan, Wacław Kuś
doaj +1 more source
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get ...
Julien Bensmail +2 more
doaj +1 more source
A new meta-heuristic algorithm: military optimization algorithm (MOA) [PDF]
تصمیم گیری و تحقیق در عملیات, 2021 Purpose: In recent years, meta-heuristic algorithms and their application in solving complicated, nonlinear, and high dimensions problems have increased dramatically and the fact that meta-heuristic algorithms are used to solve complex and changing ...
Hojatollah Rajabi Moshtaghi +2 more
doaj +1 more source
Niching genetic algorithms for optimization in electromagnetics. I. Fundamentals [PDF]
, 1998 Niching methods extend genetic algorithms and permit the investigation of multiple optimal solutions in the search space. In this paper, we review and discuss various strategies of niching for optimization in electromagnetics.
Sareni, Bruno +2 more
core +1 more source
On locally irregular decompositions and the 1-2 Conjecture in digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring.
Olivier Baudon +3 more
doaj +1 more source