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.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- A construction for binary matroids (Q1102297) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Euclidean semi-matchings of random samples (Q1184341) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- Edge coloring nearly bipartite graphs (Q1306362) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
