New polynomial bounds for matroidal knapsacks

DOI10.1016/0377-2217(95)00248-0zbMath0953.90564OpenAlexW2079010058MaRDI QIDQ1278377

Lígia Amado, Paulo Barcia

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00248-0

zbMATH Keywords

relaxationmatroidsmatroidal knapsack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (1)

Implicit cover inequalities

Cites Work

• The matroidal knapsack: A class of (often) well-solvable problems
• Matroidal relaxations for 0-1 knapsack problems
• Ordered matroids and regular independence systems

This page was built for publication: New polynomial bounds for matroidal knapsacks