کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4651581 1632579 2016 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut
چکیده انگلیسی
In this paper we consider the k-node connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines and discuss some reduction operations that can be used in a preprocessing phase for the separation. Using those results, we devise a Branch-and-Cut algorithm and present some preliminary computational results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 52, June 2016, Pages 117-124
نویسندگان
, , , ,