On inequalities with bounded coefficients and pitch for the min knapsack polytope

Ola Nils Anders Svensson, Igor Malinovic
2022

Abstract

The min knapsack problem appears as a major component in the structure of capacitated covering problems. Its polyhedral relaxations have been extensively studied, leading to strong relaxations for networking, scheduling and facility location problems.

Official source

https://infoscience.epfl.ch/entities/publication/cd11f3a0-34de-4021-8311-3b26d9efe377

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.