Skip to main navigation Skip to search Skip to main content

On Integer Polytopes with Few Nonzero Vertices

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We provide a simple description in terms of linear inequalities of the convex hull of the nonnegative integer vectors x that satisfy a given linear knapsack covering constraint
Original languageEnglish
Pages (from-to)74-77
JournalOperations Research Letters
Volume41
Issue number1
DOIs
Publication statusPublished - 2013

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 10 - Reduced Inequalities
    SDG 10 Reduced Inequalities

Fingerprint

Dive into the research topics of 'On Integer Polytopes with Few Nonzero Vertices'. Together they form a unique fingerprint.

Cite this