Pages that link to "Item:Q3648510"

The following pages link to Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited (Q3648510):

Displayed 19 items.

• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) ‎ (← links)
• On the transportation problem with market choice (Q479018) ‎ (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) ‎ (← links)
• Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) ‎ (← links)
• The stable fixtures problem with payments (Q1651275) ‎ (← links)
• The generalized arc routing problem (Q1688441) ‎ (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) ‎ (← links)
• Binary Steiner trees: structural results and an exact solution approach (Q1751166) ‎ (← 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)
• Facets from gadgets (Q2220662) ‎ (← links)
• A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) ‎ (← links)
• Parity polytopes and binarization (Q2283103) ‎ (← links)
• The Stable Fixtures Problem with Payments (Q2827801) ‎ (← links)
• An exact algorithm for solving the ring star problem (Q3553757) ‎ (← links)
• Densities, Matchings, and Fractional Edge-Colorings (Q4620419) ‎ (← links)
• Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) ‎ (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) ‎ (← links)
• The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) ‎ (← links)