Separation algorithms for 0-1 knapsack polytopes - Research Portal | Lancaster University

Home > Research > Publications & Outputs > Separation algorithms for 0-1 knapsack polytopes

Management Science

Keywords

integer programming, combinatorial optimisation, knapsack problems, cutting planes

View graph of relations

Separation algorithms for 0-1 knapsack polytopes

Research output: Contribution to conference › Conference paper

Published

Adam Letchford

Publication date	11/2008
Number of pages	1
<mark>Original language</mark>	English
Event	Bonn Workshop on Combinatorial Optimisation - Bonn, Germany

Conference

Conference	Bonn Workshop on Combinatorial Optimisation
Country	Germany
City	Bonn
Period	3/11/08 → 7/11/08