Pages that link to "Item:Q3703586"

The following pages link to Minimum cuts, modular functions, and matroid polyhedra (Q3703586):

Displaying 23 items.

• Bimonotone linear inequalities and sublattices of \(\mathbb R^n\) (Q817640) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Soft arc consistency revisited (Q969527) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Testing membership in matroid polyhedra (Q1056350) (← links)
• On submodular function minimization (Q1104332) (← links)
• Cones of alternating and cut submodular set functions (Q1121293) (← links)
• Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
• The complexity of controlled selection (Q1173958) (← links)
• Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
• Lattice matrices, intersection of ring families and dicuts (Q1208350) (← links)
• A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
• Optimum partitioning into intersections of ring families (Q1363743) (← links)
• Who should get vaccinated? Individualized allocation of vaccines over SIR network (Q2106396) (← links)
• Separation of partition inequalities with terminals (Q2386198) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• Submodular containment is hard, even for networks (Q2564307) (← links)
• Network reinforcement (Q2583121) (← links)
• Strength and reinforcement of a network and tree packing (Q4007379) (← links)
• Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
• A characterization of network representable polymatroids (Q5202490) (← links)