An algorithm for the multiparametric 0–1-integer linear programming problem relative to the constraint matrix

An algorithm for the multiparametric 0–1-integer linear programming problem relative to the constraint matrix

0.00 Avg rating0 Votes
Article ID: iaor2006351
Country: Netherlands
Volume: 27
Issue: 1
Start Page Number: 13
End Page Number: 19
Publication Date: Aug 2000
Journal: Operations Research Letters
Authors:
Keywords: programming: parametric
Abstract:

The multiparametric 0–1-Integer Linear Programming (0–1-ILP) problem relative to the constraint matrix is a family of 0–1-ILP problems in which the problems are related by having identical objective and right-hand-side vectors. In this paper we present an algorithm to perform a complete multiparametric analysis.

Reviews

Required fields are marked *. Your email address will not be published.