On a general framework for network representability in discrete optimization (extended abstract)

DOI10.1007/978-3-319-45587-7_32zbMATH Open1452.90222OpenAlexW2509104009MaRDI QIDQ2835692FDOQ2835692

Authors: Yuni Iwamasa 

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_32

Recommendations

• On a general framework for network representability in discrete optimization
• Submodular functions in problems of synthesis of networks
• A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
• Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
• The Expressive Power of Binary Submodular Functions

zbMATH Keywords

expressive powervalued constraint satisfaction problem\(k\)-submodular functionnetwork representability

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Geometric algorithms and combinatorial optimization
• Submodular functions and optimization.
• Half-integrality, LP-branching, and FPT algorithms
• Max flows in \(O(nm)\) time, or better
• The complexity of valued constraint satisfaction problems
• An algebraic theory of complexity for discrete optimization.
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• The expressive power of binary submodular functions
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
• Towards minimizing \(k\)-submodular functions
• The power of linear programming for general-valued CSPs
• Learning with submodular functions: a convex optimization perspective

Cited In (3)

• Discrete convex functions on graphs and their algorithmic applications
• A compact representation for minimizers of \(k\)-submodular functions
• On a general framework for network representability in discrete optimization

This page was built for publication: On a general framework for network representability in discrete optimization (extended abstract)

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