Results 51 to 60 of about 790 (89)
Optimization applications of Goldbach's conjecture. [PDF]
Heliyon, 2023 Lin BMT, Lin SM, Shyu SJ.
europepmc +1 more source
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
EURO Journal on Computational Optimization, 2016 In this paper, we consider the problem of hospital evacuation and model it as a multi-mode resource-constrained project scheduling problem (MRCPSP) with additional resource transfers and blockings.
Jens Poppenborg, Sigrid Knust
doaj
An exact approach for the multi-constraint graph partitioning problem
EURO Journal on Computational Optimization, 2020 In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple weights on the nodes. The problem calls for a partition of the node set into a fixed number of clusters, such
Diego Recalde, Ramiro Torres, Polo Vaca
doaj
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Pattern Recognit Lett, 2022 Gopalakrishnan S +4 more
europepmc +1 more source
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization, 2019 The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
doaj
The complete vertex p-center problem
EURO Journal on Computational Optimization, 2020 The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized.
F.Antonio Medrano
doaj
Optimal capacitated ring trees
EURO Journal on Computational Optimization, 2016 We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees.
Alessandro Hill, Stefan Voß
doaj
A Note on the Stability Number of an Orthogonality Graph [PDF]
We consider the orthogonality graph (n) with 2n vertices corresponding to the vectors {0, 1}n, two vertices adjacent if and only if the Hamming distance between them is n/2.We show that, for n = 16, the stability number of (n) is ( (16)) = 2304, thus ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
Continuous facility location on graphs. [PDF]
Math Program, 2022 Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source