Pages that link to "Item:Q1056350"

The following pages link to Testing membership in matroid polyhedra (Q1056350):

Displaying 36 items.

• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• New approaches to multi-objective optimization (Q403670) (← links)
• Security games on matroids (Q507326) (← links)
• Faster algorithms for security games on matroids (Q666676) (← links)
• A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
• Polyhedra with the integer Carathéodory property (Q765190) (← links)
• Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
• A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
• An integer analogue of Carathéodory's theorem (Q1074117) (← links)
• The principal lattice of partitions of a submodular function (Q1174311) (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
• Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← 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)
• Strength of a graph and packing of trees and branchings (Q1895050) (← links)
• Integral packing of trees and branchings (Q1907770) (← links)
• Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
• A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
• The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
• Layers and matroids for the traveling salesman's paths (Q2417048) (← links)
• Degree bounded matroids and submodular flows (Q2448960) (← links)
• Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• Graphic Submodular Function Minimization: A Graphic Approach and Applications (Q2971617) (← links)
• On the cardinality constrained matroid polytope (Q3008918) (← links)
• Submodular Stochastic Probing on Matroids (Q3186541) (← links)
• Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry (Q3186829) (← links)
• Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
• ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
• (Q5092350) (← links)
• Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
• Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)