Implicit cover inequalities

DOI10.1007/S10878-014-9812-3MaRDI QIDQ266036zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Agostinho Agra, Cristina Requejo, Eulália Santos

Publication date 13 April 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-014-9812-3

zbMATH Keywords

cover inequalitiesliftingmatroidal knapsackweighted minimal spanning tree problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• A polyhedral study of the cardinality constrained knapsack problem
• scientific article; zbMATH DE number 2086929
• Second-order cover inequalities

Cites work

• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• A generalization of antiwebs to independence systems and their canonical facets
• Algorithms to solve the knapsack constrained maximum spanning tree problem
• An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
• Canonical Cuts on the Unit Hypercube
• Easily Computable Facets of the Knapsack Polytope
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Facets of the Knapsack Polytope From Minimal Covers
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• New polynomial bounds for matroidal knapsacks
• On the weight-constrained minimum spanning tree problem
• Separation algorithms for 0-1 knapsack polytopes
• Sequence independent lifting in mixed integer programming
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• The complexity of cover inequality separation
• The constrained minimum spanning tree problem
• The matroidal knapsack: A class of (often) well-solvable problems
• Where are the hard knapsack problems?

Cited in

(1)

• An implicit cover problem in wild population study

This page was built for publication: Implicit cover inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266036)