A cutting plane method for knapsack polytope
From MaRDI portal
Publication:2391714
Recommendations
Cites work
- A bionomic approach to the capacitated \(p\)-median problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A computational study of exact knapsack separation for the generalized assignment problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A new method for solving capacitated location problems based on a set partitioning approach
- Facets of the knapsack polytope
- Fenchel Cutting Planes for Integer Programs
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- scientific article; zbMATH DE number 5158528 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- On the Exact Separation of Mixed Integer Knapsack Cuts
- On the facial structure of set packing polyhedra
- Separation algorithms for 0-1 knapsack polytopes
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Two exact algorithms for the capacitated p-median problem
Cited in
(6)- Cutting planes for mixed-integer knapsack polyhedra
- An implementation of exact knapsack separation
- A pseudopolynomial network flow formulation for exact knapsack separation
- Solving Multiple Knapsack Problems by Cutting Planes
- Knapsack polytopes: a survey
- A computational study of exact knapsack separation for the generalized assignment problem
This page was built for publication: A cutting plane method for knapsack polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391714)
