Implicit cover inequalities

In this paper we consider combinatorial optimization problems whose feasible sets are simultaneously restricted by a binary knapsack constraint and a cardinality constraint imposing the exact number of selected variables. In particular, such sets arise when the feasible set corresponds to the bases...

Full description

Bibliographic Details
Main Author: Agra, Agostinho (author)
Other Authors: Requejo, Cristina (author), Santos, Eulália (author)
Format: article
Language:eng
Published: 2016
Subjects:
Cover inequalities
Weighted minimal spanning tree problem
Lifting
Matroidal knapsack
Online Access:http://hdl.handle.net/10773/16491
Country:Portugal
Oai:oai:ria.ua.pt:10773/16491

Internet

http://hdl.handle.net/10773/16491

Similar Items