Results 21 to 30 of about 737 (80)
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 +1 more source
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources
PANDA: a software for polyhedral transformations
EURO Journal on Computational Optimization, 2015 In this paper, we present the software Parallel AdjaceNcy Decomposition Algorithm (PANDA), an efficient implementation of the vertex and facet enumeration problem for polyhedra. The software is based on the double description method. Special features are
Stefan Lörwald, Gerhard Reinelt
doaj +1 more source
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 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
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
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
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