Search
CSV
RISTwo Extended Formulations for Cardinality Maximum Flow Network Interdiction Problem
We consider the maximum flow network interdiction problem in its cardinality case. There is an integer programming model for this problem byWood (Math Comput Model 17 (1993), 1–18). Two types of valid inequalities have ...
Solving the p-median problem with pos/neg weights by variable neighborhood search and some results f
The p-median problem with positive and negative weights has been introduced by Burkard and Krarup [Computing 60 (1998) 193]. In this paper we discuss some special cases of this problem on search procedure for general ...
An ant colony algorithm for the pos/neg weighted p-median problem
Abstract Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset $$X\\\\subseteq V$$ of cardinality p, so that the (weighted) sum of the ...
Emergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency
services have attracted the attention of researchers. Mathematical models, both deterministic
and probabilistic, have ...
Locating a single facility in the plane in the presence of a bounded region and different norms
We consider the problem of locating a single new facility in the plane in the presence of a bounded region, where..
On a class of subadditive duals for the uncapacitated facility location problem
A family of subadditive functions which contains the optimal solution of subadditive duals for integer programs has been presented by Klabjan (2007). In this paper we present a subadditive dual ascent procedure to find an ...
Maximal covering location-allocation problem with M/M/k queueing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in ...
A BSSS algorithm for the single facility location problem in two regions with different norms
Suppose the plane is divided by a straight line into two regions with different norms. We want to find the location of a
single new facility such that the sum of the distances from the existing facilities to this ...
بهینه سازی استوار مسأله مکان‌یابی تسهیلات چند دوره‌ای
دسته‌ای از روش‌هایی که در سال‌های اخیر برای لحاظ کردن عدم قطعیت در مدل‌های بهینه‌سازی مورد توجه قرار گرفته است تحت عنوان بهینه‌سازی استوار مطرح شده است و مدل‌های مختلفی از آن ارائه شده است.
در این مقاله به بررسی ...
Maximum Dynamic Flow Interdiction Problem
Maximum dynamic flow interdiction problem
Let G = (N, A) be a directed graph with a given source node s, and
a given sink node t. Let N = (G, u, τ, r) be the associated dynamic network
with arc capacities ...