Minimal equivalent binary knapsack inequalities

DOI10.1287/IJOC.1100.0408zbMATH Open1243.90139OpenAlexW2007858705MaRDI QIDQ2899135

Gary J. Koehler

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1100.0408

zbMATH Keywords

computational complexitysubset sumhard knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

This page was built for publication: Minimal equivalent binary knapsack inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899135)