Exact algorithms for combinatorial optimization problems with submodular objective functions

DOI10.1007/978-3-642-38189-8_12MaRDI QIDQ5265174zbMATH OpenOpenAlexFDO

Authors Frank Baumann, Sebastian Berckey, Christoph Buchheim

Publication date 22 July 2015

Published in Facets of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38189-8_12

zbMATH Keywords

Lagrangean decompositionlinearization approach

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4137537
• scientific article; zbMATH DE number 3912107
• An efficient branch-and-cut algorithm for submodular function maximization
• Improved algorithms for submodular function minimization and submodular flow
• scientific article; zbMATH DE number 569962

Cited in

(9)

• New algorithms for the intersection problem of submodular systems
• Polyhedral results for a class of cardinality constrained submodular minimization problems
• Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
• scientific article; zbMATH DE number 5888315 (Why is no real title available?)
• Lagrangean decomposition for mean-variance combinatorial optimization
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• Deterministic Algorithms for Submodular Maximization Problems
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Combinatorial optimal control of semilinear elliptic PDEs

This page was built for publication: Exact algorithms for combinatorial optimization problems with submodular objective functions

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