Pages that link to "Item:Q1078187"

The following pages link to On the cycle polytope of a binary matroid (Q1078187):

Displaying 45 items.

• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
• A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• The inequicut cone (Q688255) (← links)
• The even and odd cut polytopes (Q688256) (← links)
• How is a chordal graph like a supersolvable binary matroid? (Q704292) (← links)
• Minimum cut bases in undirected networks (Q968141) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• Solving the prize-collecting rural postman problem (Q1041930) (← links)
• Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
• On a composition of independence systems by circuit identification (Q1186136) (← links)
• Facets for the cut cone. I (Q1199749) (← links)
• T-uniqueness of some families of \(k\)-chordal matroids (Q1432995) (← links)
• Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions (Q1569057) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• The undirected capacitated general routing problem with profits (Q1752868) (← links)
• Pseudocodeword-free criterion for codes with cycle-free Tanner graph (Q1801093) (← links)
• Master polytopes for cycles of binary matroids (Q1824625) (← links)
• Application of cut polyhedra. I (Q1891019) (← links)
• Facets of the \(k\)-partition polytope (Q1897366) (← links)
• A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
• Cuboids, a class of clutters (Q1985449) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
• Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
• Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
• Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
• On the circuit-spectrum of binary matroids (Q2275475) (← links)
• Idealness and 2-resistant sets (Q2294336) (← links)
• Multi-depot rural postman problems (Q2408522) (← links)
• On the general routing polytope (Q2473035) (← links)
• Privatized rural postman problems (Q2496044) (← links)
• On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
• Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• A Semiring on Convex Polygons and Zero-Sum Cycle Problems (Q3495676) (← links)
• Binary Supersolvable Matroids and Modular Constructions (Q3982141) (← links)
• Recognizing Even-Cycle and Even-Cut Matroids (Q5041745) (← links)
• Upgrading edges in the graphical TSP (Q6047867) (← links)
• The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)
• Chordal matroids arising from generalized parallel connections (Q6184905) (← links)
• Cycle algebras and polytopes of matroids (Q6199040) (← links)
• Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)