Pages that link to "Item:Q847846"

The following pages link to Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846):

Displaying 16 items.

• Generalized roof duality and bisubmodular functions (Q412330) (← links)
• Submodular function minimization (Q995782) (← links)
• L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Lattice polyhedra and submodular flows (Q1926644) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Generalized skew bisubmodularity: a characterization and a min-max theorem (Q2339806) (← links)
• Parametric bisubmodular function minimization and its associated signed ring family (Q2357141) (← links)
• A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
• A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Signed ring families and signed posets (Q4999327) (← links)
• Greedy systems of linear inequalities and lexicographically optimal solutions (Q5214340) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)