Implicit cover inequalities
From MaRDI portal
Publication:266036
DOI10.1007/s10878-014-9812-3zbMath1364.90283OpenAlexW2013296632WikidataQ57736512 ScholiaQ57736512MaRDI QIDQ266036
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
Cites Work
- Unnamed Item
- Unnamed Item
- The matroidal knapsack: A class of (often) well-solvable problems
- A generalization of antiwebs to independence systems and their canonical facets
- New polynomial bounds for matroidal knapsacks
- The complexity of cover inequality separation
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Where are the hard knapsack problems?
- Sequence independent lifting in mixed integer programming
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- Easily Computable Facets of the Knapsack Polytope
- On the Weight-Constrained Minimum Spanning Tree Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- 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
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- Algorithms to solve the knapsack constrained maximum spanning tree problem
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- The constrained minimum spanning tree problem
- Canonical Cuts on the Unit Hypercube
This page was built for publication: Implicit cover inequalities
