Approximate Submodularity in Network Design Problems

DOI10.1287/OPRE.2022.2408MaRDI QIDQ6192780zbMATH OpenOpenAlexFDO

Authors Levi Devalve, Saša Pekeč, Yehua Wei

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2022.2408

zbMATH Keywords

approximate submodularitynetwork designprocess flexibility

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Production models (90B30) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation algorithm for the warehouse-retailer network design problem with submodular penalties
• On approximation of the submodular set cover problem
• A note on the subadditive network design problem
• Designing flexible systems using a new notion of submodularity
• Minimization problems with non-submodular cover constraint

Cited in

(1)

• Approximation algorithms for k-scenario matching

This page was built for publication: Approximate Submodularity in Network Design Problems

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