A cutting plane method for knapsack polytope

DOI10.1134/S1064230709010067zbMath1269.90097MaRDI QIDQ2391714

Igor' Leonidovich Vasilyev

Publication date: 5 August 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Knapsack polytopes: a survey ⋮ An implementation of exact knapsack separation

Uses Software

• CPLEX
• OR-Library
• Knapsack
• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational study of exact knapsack separation for the generalized assignment problem
• A bionomic approach to the capacitated \(p\)-median problem
• Two exact algorithms for the capacitated \(p\)-median problem
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• Separation algorithms for 0-1 knapsack polytopes
• Facets of the knapsack polytope
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Fenchel Cutting Planes for Integer Programs
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A branch‐and‐price algorithm for the capacitated p‐median problem
• On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
• On the facial structure of set packing polyhedra
• On the Exact Separation of Mixed Integer Knapsack Cuts
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: A cutting plane method for knapsack polytope