کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1141820 957094 2006 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Description of 2-integer continuous knapsack polyhedra
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
Description of 2-integer continuous knapsack polyhedra
چکیده انگلیسی

In this paper we discuss the polyhedral structure of several mixed integer sets involving two integer variables. We show that the number of the corresponding facet-defining inequalities is polynomial on the size of the input data and their coefficients can also be computed in polynomial time using a known algorithm [D. Hirschberg, C. Wong, A polynomial-time algorithm for the knapsack problem with two variables, Journal of the Association for Computing Machinery 23 (1) (1976) 147–154] for the two integer knapsack problem. These mixed integer sets may arise as substructures of more complex mixed integer sets that model the feasible solutions of real application problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 3, Issue 2, 1 June 2006, Pages 95–110
نویسندگان
, ,