New polynomial bounds for matroidal knapsacks

DOI10.1016/0377-2217(95)00248-0zbMATH Open0953.90564OpenAlexW2079010058MaRDI QIDQ1278377FDOQ1278377

Authors: 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

Recommendations

• Matroidal relaxations for 0-1 knapsack problems
• The matroidal knapsack: A class of (often) well-solvable problems
• Multi-constrained matroidal knapsack problems
• A new upper bound for the multiple knapsack problem

zbMATH Keywords

matroidal knapsackrelaxationmatroids

Mathematics Subject Classification ID

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

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

Cited In (5)

• Implicit cover inequalities
• Matroidal relaxations for 0-1 knapsack problems
• The matroidal knapsack: A class of (often) well-solvable problems
• A new upper bound for the multiple knapsack problem
• Title not available (Why is that?)

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

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