A submodular optimization problem with side constraints

DOI10.1007/3-540-61310-2_19zbMath1415.90136OpenAlexW1635913857MaRDI QIDQ4645927

David B. Hartvigsen

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_19

zbMATH Keywords

incidence matrixaffine spacefeasible solutionflow problemside constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality for balanced submodular flows
• Matching theory
• Submodular functions and optimization
• Computing maximum mean cuts
• Towards equitable distribution via proportional equity constraints
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Maximal Flow Through a Network
• Submodular systems and related topics
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Optimal sharing
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The Sharing Problem

This page was built for publication: A submodular optimization problem with side constraints