Results 31 to 40 of about 789 (94)
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 +1 more source
On stability of Nash equilibrium situations and Pareto optimal situations in finite games [PDF]
Computer Science Journal of Moldova, 2003 A non-cooperative finite game of several persons is considered in the case, where payoff functions are linear. Extreme levels of independent perturbations of payoff functions parameters, which remain Nash and Pareto optimality of a situation, are ...
Vladimir A. Emelichev +1 more
doaj
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 +1 more source
Discrete concavity and the half-plane property [PDF]
, 2009 Murota et al. have recently developed a theory of discrete convex analysis which concerns M-convex functions on jump systems. We introduce here a family of M-concave functions arising naturally from polynomials (over a field of generalized Puiseux series)
Buch A. S. +4 more
core +3 more sources
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria [PDF]
Computer Science Journal of Moldova, 2009 In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original ...
Vladimir A. Emelichev, Olga V. Karelkina
doaj
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 +1 more source
On the rank functions of $\mathcal{H}$-matroids
, 2016 The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm.
Sano, Yoshio
core +2 more sources
Sink location to find optimal shelters in evacuation planning
EURO Journal on Computational Optimization, 2016 The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W.
P. Heßler, H.W. Hamacher
doaj +1 more source
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 +1 more source
Matching ontologies with kernel principle component analysis and evolutionary algorithm
Demonstratio MathematicaOntology serves as a structured knowledge representation that models domain-specific concepts, properties, and relationships. Ontology matching (OM) aims to identify similar entities across distinct ontologies, which is essential for enabling ...
Xue Xingsi, Ye Miao, Nian Qifeng
doaj +1 more source