Pages that link to "Item:Q3965907"
From MaRDI portal
The following pages link to Odd Minimum Cut-Sets and <i>b</i>-Matchings (Q3965907):
Displaying 50 items.
- On edge-colouring indifference graphs (Q1391299) (← links)
- A simple minimum \(T\)-cut algorithm (Q1406048) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A cutting plane algorithm for minimum perfect 2-matchings (Q1821798) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Four problems on graphs with excluded minors (Q1823871) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
- Coordinating resources in Stackelberg security games (Q2030646) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
- Co-density and fractional edge cover packing (Q2175043) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Facets from gadgets (Q2220662) (← links)
- Parity polytopes and binarization (Q2283103) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
