دانلود مقاله ISI انگلیسی شماره70488
ترجمه فارسی عنوان مقاله

طراحی شبکه بی نظیر غیر افزایشی با استفاده از چند مجموعه ای توابع مجموعه

عنوان انگلیسی
Unsplittable non-additive capacitated network design using set functions polyhedra
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی ترجمه فارسی
70488 2016 11 صفحه PDF سفارش دهید
دانلود فوری مقاله + سفارش ترجمه
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Computers & Operations Research, Volume 66, February 2016, Pages 105–115

چکیده انگلیسی

In this paper, we address the Unsplittable Non-Additive Capacitated Network Design problem, a variant of the Capacitated Network Design problem where the flow of each commodity cannot be split, even between two facilities installed on the same link. We propose a compact formulation and an aggregated formulation for the problem. The latter requires additional inequalities from considering each individual arc-set. Instead of studying those particular polyhedra, we consider a much more general object, the unitary step monotonically increasing set function polyhedra, and identify some families of facets. The inequalities that are obtained by specializing those facets to the Bin Packing function are separated in a Branch-and-Cut for the problem. Several series of experiments are conducted on random and realistic instances to give an insight on the efficiency of the introduced valid inequalities.

دانلود فوری مقاله + سفارش ترجمه
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.