Pages that link to "Item:Q1104332"

The following pages link to On submodular function minimization (Q1104332):

Displaying 30 items.

• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
• Submodular function minimization (Q995782) (← links)
• A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
• Paths on polymatroids (Q1196722) (← links)
• Minimizing symmetric submodular functions (Q1290631) (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
• The toughness of split graphs (Q1584388) (← links)
• The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
• A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
• A rounding technique for the polymatroid membership problem (Q1893104) (← links)
• Minimum cuts in parametric networks (Q1905228) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Dispersing obnoxious facilities on a graph (Q2032349) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• On additive approximate submodularity (Q2672599) (← links)
• The holographic entropy cone from marginal independence (Q2682217) (← links)
• On the foundations and extremal structure of the holographic entropy cone (Q2685693) (← links)
• Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM (Q3502844) (← links)
• Continuous limits of discrete perimeters (Q3552260) (← links)
• Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
• (Q5708558) (← links)
• A strongly polynomial time algorithm for a constrained submodular optimization problem (Q5951962) (← links)