Pages that link to "Item:Q1202762"

The following pages link to New algorithms for the intersection problem of submodular systems (Q1202762):

Displaying 12 items.

• A fast cost scaling algorithm for submodular flow (Q294751) (← links)
• Minimizing a sum of submodular functions (Q713320) (← links)
• Submodular function minimization (Q995782) (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
• A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
• A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem (Q2089770) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
• Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
• Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)