Results 21 to 30 of about 143 (125)
A greedy algorithm for interval greedoids
Open Mathematics, 2018 We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
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 +1 more source
Branch and win: OR tree search algorithms for solving combinatorial optimisation problems [PDF]
, 2004 Combinatorial optimization, branch and bound, artificial intelligence, 90C27, 90C57, 68T20,
Corominas Subias, Albert +3 more
core +1 more source
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
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
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
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
Comparison of alignment free string distances for complete genome phylogeny
, 2009 Phylogeny, String distances, Complete bacterial genomes, 05C05, 68R15, 90C27, 92B10,
Alain Guénoche +7 more
core +1 more source
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