Odd Minimum Cut-Sets and b-Matchings
From MaRDI portal
Publication:3965907
Cited in
(only showing first 100 items - show all)- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Minimizing the stabbing number of matchings, trees, and triangulations
- Solving the prize-collecting rural postman problem
- Polyhedral proof methods in combinatorial optimization
- Decomposition and optimization over cycles in binary matroids
- A construction for binary matroids
- The ellipsoid method and its consequences in combinatorial optimization
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
- A polyhedral approach to edge coloring
- Euclidean semi-matchings of random samples
- Expressing combinatorial optimization problems by linear programs
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Matching theory -- a sampler: From Dénes König to the present
- A cutting plane algorithm for the windy postman problem
- The optimal path-matching problem
- New inequalities for the general routing problem
- Minimizing symmetric submodular functions
- An efficient approximation algorithm for the survivable network design problem
- The rural postman problem with deadline classes
- Edge coloring nearly bipartite graphs
- A primal dual integer programming algorithm
- A separation algorithm for the matchable set polytope
- On the complexity of some basic problems in computational convexity. I. Containment problems
- A branch-and-cut algorithm for the equicut problem
- On approximately fair cost allocation in Euclidean TSP games
- On edge-colouring indifference graphs
- A simple minimum \(T\)-cut algorithm
- A compact linear program for testing optimality of perfect matchings.
- On the cut polyhedron.
- Exact approaches for the orderly colored longest path problem: performance comparison
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- The generalized arc routing problem
- Computing girth and cogirth in perturbed graphic matroids
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- On the complexity of the separation problem for rounded capacity inequalities
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A cutting plane algorithm for minimum perfect 2-matchings
- Facets and algorithms for capacitated lot sizing
- Four problems on graphs with excluded minors
- A GRASP heuristic for the mixed Chinese postman problem
- A cutting plane algorithm for the capacitated arc routing problem
- Minimizing submodular functions over families of sets
- On two-connected subgraph polytopes
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A polyhedral approach to an integer multicommodity flow problem
- Solving the length constrained K-drones rural postman problem
- Coordinating resources in Stackelberg security games
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem
- Revisiting a cutting-plane method for perfect matchings
- Co-density and fractional edge cover packing
- Postman problems on series-parallel mixed graphs
- Edge-colouring graphs with bounded local degree sums
- Facets from gadgets
- Parity polytopes and binarization
- OAR lib: an open source arc routing library
- Extended formulations for radial cones
- Fractional matching preclusion number of graphs and the perfect matching polytope
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Edge-colouring of join graphs
- When the Gomory-chvátal closure coincides with the integer hull
- Fractionally total colouring \(G_{n,p}\)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- A comparison of two different formulations for arc routing problems on mixed graphs
- A linear programming formulation of Mader's edge-disjoint paths problem
- New techniques for cost sharing in combinatorial optimization games
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- The capacitated arc routing problem with intermediate facilities
- The cutting plane method is polynomial for perfect matchings
- Optimal edge-coloring with edge rate constraints
- A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
- Efficient approximation algorithms for weighted b-matching
- A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
- Fractionally edge colouring graphs with large maximum degree in linear time
- Steiner networks with unicyclic connected components
- Facet generating techniques
- Min-Max K-vehicles windy rural postman problem
- The proportional coloring problem: optimizing buffers in radio mesh networks
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A branch-and-cut framework for the consistent traveling salesman problem
- A branch-and-cut algorithm for the profitable windy rural postman problem
- Fractional covers for forests and matchings
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Improved bounds for large scale capacitated arc routing problem
- An exact algorithm for solving the ring star problem
- Solving matching problems with linear programming
- Scaling: A general framework
- Modeling and solving the mixed capacitated general routing problem
- Densities, matchings, and fractional edge-colorings
- Tree metrics and edge-disjoint \(S\)-paths
- Provably good solutions for the traveling salesman problem
- The convex hull of a linear congruence relation in zero-one variables
- On Four Problems in Graph Theory
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
This page was built for publication: Odd Minimum Cut-Sets and b-Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3965907)
