Results 1 to 10 of about 327 (90)
Robust flows with adaptive mitigation
EURO Journal on Computational Optimization, 2021 We consider an adjustable robust optimization problem arising in the area of supply chains: given sets of suppliers and demand nodes, we wish to find a flow that is robust with respect to failures of the suppliers.
Heiner Ackermann +2 more
doaj +1 more source
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
, 2008 Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
AS Tanenbaum +19 more
core +2 more sources
Why Optimal States Recruit Fewer Reactions in Metabolic Networks [PDF]
, 2012 The metabolic network of a living cell involves several hundreds or thousands of interconnected biochemical reactions. Previous research has shown that under realistic conditions only a fraction of these reactions is concurrently active in any given cell.
Lee, Joo Sang +2 more
core +1 more source
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
EURO Journal on Computational Optimization, 2015 This paper studies the behavior of compact formulations for solving the maximum edge-weight clique (MEWC) problem in sparse graphs. The MEWC problem has long been discussed in the literature, but mostly addressing complete graphs, with or without a ...
Luis Gouveia, Pedro Martins
doaj +1 more source
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
EURO Journal on Computational Optimization, 2019 We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized.
VilmarJefté Rodrigues de Sousa +2 more
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
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source
Evacuation modeling: a case study on linear and nonlinear network flow models
EURO Journal on Computational Optimization, 2016 We present a nonlinear traffic flow network model that is coupled to gaseous hazard information for evacuation planning. This model is evaluated numerically against a linear network flow model for different objective functions that are relevant for ...
Simone Göttlich +3 more
doaj +1 more source
Uniqueness of market equilibria on networks with transport costs
Operations Research Perspectives, 2018 We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity ...
Vanessa Krebs, Martin Schmidt
doaj +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