On inner independence systems

DOI10.1002/NAV.22210MaRDI QIDQ7028668zbMATH OpenFDO

Authors Sven De Vries, Stephen Raach, Rakesh V. Vohra

Publication date 11 February 2025

Published in Naval Research Logistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NAV.22210

zbMATH Keywords

greedy algorithmindependence systemsinner approximationpacking problems

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A greedy algorithm for solving a certain class of linear programmes
• An Analysis of the Greedy Heuristic for Independence Systems
• Combinatorial auctions: a survey
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Discrete-variable extremum problems
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• scientific article; zbMATH DE number 3819459 (Why is no real title available?)
• scientific article; zbMATH DE number 3544074 (Why is no real title available?)
• Matroidal approximations of independence systems
• Max-min greedy matching
• Worst case analysis of greedy type algorithms for independence systems
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

This page was built for publication: On inner independence systems

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