scientific article; zbMATH DE number 3637616
From MaRDI portal
Publication:4197644
Cited in
(50)- Weighted restricted 2-matching
- Short proofs on the matching polyhedron
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
- Packings by cliques and by finite families of graphs
- An integer analogue of Carathéodory's theorem
- Algorithms for finding k-best perfect matchings
- Total dual integrality and b-matchings
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
- Tight integral duality gap in the Chinese postman problem
- An identity for matching and skew-symmetric determinant
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- New primal and dual matching heuristics
- The Schrijver system of the flow cone in series-parallel graphs
- Minimum cost b-matching problems with neighborhoods
- Stochastic packing integer programs with few queries
- On dual integrality in matching problems
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- An algorithmic approach to dual integrality of matching and extensions
- A weighted independent even factor algorithm
- Bi-criteria and approximation algorithms for restricted matchings
- Facets of the independent path-matching polytope
- Fast algorithms for the undirected negative cost cycle detection problem
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Constrained multi-object auctions and b-matching
- Optimal matching forests and valuated delta-matroids
- Linear-time approximation for maximum weight matching
- Matching problems with generalized upper bound side constraints
- Proving total dual integrality with cross-free families—A general framework
- Node-balancing by edge-increments
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- Efficient dual simplex algorithms for the assignment problem
- Solving matching problems with linear programming
- Optimum matching forests II: General weights
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- When is the matching polytope box-totally dual integral?
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Total dual integrality and integer polyhedra
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
- A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
- Hard problems on box-totally dual integral polyhedra
- Popular roommates in simply exponential time
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors
- The cyclical scheduling problem
- Total weak unimodularity: Testing and applications
- A note on matchings and separability
- On the feedback vertex set polytope of a series-parallel graph
- A weighted even factor algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197644)
