On the exact separation of cover inequalities of maximum-depth
From MaRDI portal
(Redirected from Publication:2115307)
Recommendations
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- On separating cover inequalities for the multidimensional knapsack problem
- On the complexity of separation from the knapsack polytope
- Separation algorithms for 0-1 knapsack polytopes
- The precedence constrained knapsack problem: separating maximally violated inequalities
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A computational study of exact knapsack separation for the generalized assignment problem
- A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem
- A genetic algorithm for the multidimensional knapsack problem
- A lexicographic pricer for the fractional bin packing problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Arbitrary-norm separating plane
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Coordinated cutting plane generation via multi-objective separation
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Engine scheduling by column generation
- Exact approaches for the knapsack problem with setups
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Integrated airline scheduling
- Knapsack polytopes: a survey
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On the product knapsack problem
- SCIP: solving constraint integer programs
- Separation algorithms for 0-1 knapsack polytopes
- Solving Large-Scale Zero-One Linear Programming Problems
- The Knapsack Problem with Conflict Graphs
- The Steiner tree problem. II: Properties and classes of facets
- The complexity of cover inequality separation
- The multidimensional knapsack problem: structure and algorithms
- \(k\)-plane clustering
Cited in
(2)
This page was built for publication: On the exact separation of cover inequalities of maximum-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115307)
