Zobrazeno 1 - 10
of 1 118
pro vyhledávání: '"Lucà E"'
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for each paramet
Externí odkaz:
http://arxiv.org/abs/2310.05147
In p-median location interdiction the aim is to find a subset of edges in a graph, such that the objective value of the p-median problem in the same graph without the selected edges is as large as possible. We prove that this problem is NP-hard even
Externí odkaz:
http://arxiv.org/abs/2301.13723
The minimum cost flow problem is one of the most studied network optimization problems and appears in numerous applications. Some efficient algorithms exist for this problem, which are freely available in the form of libraries or software packages. I
Externí odkaz:
http://arxiv.org/abs/2210.02195
Publikováno v:
In Discrete Optimization February 2024 51
This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum flows from a source to a sink are to be computed independently of each
Externí odkaz:
http://arxiv.org/abs/2010.02730
In this article, we study a biobjective extension of the shortest path network interdiction problem. Each arc in the network is associated with two integer length values and two players compute their respective shortest paths from source to sink inde
Externí odkaz:
http://arxiv.org/abs/2004.08338
Autor:
Schäfer, Luca E., Dietz, Tobias, Barbati, Maria, Figueira, José Rui, Greco, Salvatore, Ruzika, Stefan
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this relation defi
Externí odkaz:
http://arxiv.org/abs/2002.04850
This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path p
Externí odkaz:
http://arxiv.org/abs/1906.05101
Autor:
Dietz, Tobias, Klamroth, Kathrin, Kraus, Konstantin, Ruzika, Stefan, Schäfer, Luca E., Schulze, Britta, Stiglmayr, Michael, Wiecek, Margaret M.
This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are associated with an
Externí odkaz:
http://arxiv.org/abs/1811.06431
We investigate the single-source-single-destination "shortest" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Fu
Externí odkaz:
http://arxiv.org/abs/1808.09410