Maximum matching and a polyhedron with 0,1-vertices
From MaRDI portal
Publication:5516087
DOI10.6028/jres.069B.013zbMath0141.21802MaRDI QIDQ5516087
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items
Equistarable bipartite graphs, Nice pairs of disjoint pentagons in fullerene graphs, Nice pairs of odd cycles in fullerene graphs, Euclidean maximum matchings in the plane -- local to global, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, On a limit of the method of Tashkinov trees for edge-colouring, A survey on flows in graphs and matroids, The cost of perfection for matchings in graphs, Grid graphs, Gorenstein polytopes, and domino stackings, Enhancing complex network controllability by minimum link direction reversal, Uniquely forced perfect matching and unique 3-edge-coloring, Makespan minimization in a no-wait flow shop problem with two batching machines, A two-stage decomposition of high school timetabling applied to cases in Denmark, The circular chromatic index of graphs of high girth, Lower bounds and exact algorithms for the quadratic minimum spanning tree problem, Average case polyhedral complexity of the maximum stable set problem, Incremental assignment problem, The max-cut problem on graphs not contractible to \(K_ 5\), Optimizing over the first Chvátal closure, König-Egerváry graphs are non-Edmonds, On extremal \(k\)-supereulerian graphs, Covering a cubic graph with perfect matchings, On vertex independence number of uniform hypergraphs, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect, On the recognition of fuzzy circular interval graphs, On the membership problem for the \({0, 1/2}\)-closure, Cycle double covers and the semi-Kotzig frame, A superlinear bound on the number of perfect matchings in cubic bridgeless graphs, The stable set polytope of icosahedral graphs, On Hilbert bases of cuts, Matching based very large-scale neighborhoods for parallel machine scheduling, Approximating the chromatic index of multigraphs, Independent sets and matchings in subcubic graphs, Cardinality constrained combinatorial optimization: complexity and polyhedra, On claw-free \(t\)-perfect graphs, On the facets of the stable set polytope of quasi-line graphs, Partitioning planar graphs: a fast combinatorial approach for max-cut, Analyzing the Held-Karp TSP bound: A monotonicity property with application, Blocking versus nonblocking interprocess communication: A note on the effect on concurrency, A simple reduction from maximum weight matching to maximum cardinality matching, Fractional total colourings of graphs of high girth, Certifying algorithms, Avoiding 7-circuits in 2-factors of cubic graphs, Measures of edge-uncolorability of cubic graphs, Complexity of the cluster deletion problem on subclasses of chordal graphs, The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory, 1-Approximation algorithm for bottleneck disjoint path matching, An extended approach for lifting clique tree inequalities, A weighted even factor algorithm, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, The stable set polytope of quasi-line graphs, Exploiting planarity in separation routines for the symmetric traveling salesman problem, Exact methods for solving the elementary shortest and longest path problems, On complexity of special maximum matchings constructing, Age-based preferences in paired kidney exchange, A comparison of two edge-coloring formulations, On cuts and matchings in planar graphs, Survivable networks, linear programming relaxations and the parsimonious property, The convex hull of two core capacitated network design problems, Graph editing problems with extended regularity constraints, On facets of stable set polytopes of claw-free graphs with stability number 3, Design tools for reporter strands and DNA origami scaffold strands, Approximation algorithms for multiple terminal, Hamiltonian path problems, My experiences as a student and researcher in OR during the 1960's and 70's, Optimal cuts in graphs and statistical mechanics, The perfect matching polytope and solid bricks, An improved linear bound on the number of perfect matchings in cubic graphs, Exponentially many perfect matchings in cubic graphs, A note on balanced bipartitions, A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors, Minimum-weight two-connected spanning networks, Simulating the impact of crossover kidney transplantation on the Nord Italia transplant program, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Gear composition and the stable set polytope, Minimizing the stabbing number of matchings, trees, and triangulations, The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect, Graphs without large apples and the maximum weight independent set problem, The cyclical scheduling problem, Extended formulations, nonnegative factorizations, and randomized communication protocols, Uncapacitated flow-based extended formulations, Weighted restricted 2-matching, Characterizing and bounding the imperfection ratio for some classes of graphs, Solving (large scale) matching problems combinatorially, Covering weighted graphs by even subgraphs, The perfectly matchable subgraph polytope of an arbitrary graph, Achieving maximum chromatic index in multigraphs, A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids, On matroid parity and matching polytopes, A note on Berge-Fulkerson coloring, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Recent trends in combinatorial optimization, Short proofs on the matching polyhedron, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, A partitioning algorithm for minimum weighted Euclidean matching, Partitioning heuristics for two geometric maximization problems, A note on matchings and separability, Shortest coverings of graphs with cycles, Solution of large-scale symmetric travelling salesman problems, BOB: Improved winner determination in combinatorial auctions and generalizations, Fast algorithms for the undirected negative cost cycle detection problem, Minimum Cost Perfect Matching with Delays for Two Sources, Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles, On Dyadic Fractional Packings of $T$-Joins, Sparktope: linear programs from algorithms, Claw‐free circular‐perfect graphs, Odd Multiway Cut in Directed Acyclic Graphs, Minimum weight euclidean matching and weighted relative neighborhood graphs, Matchings in regular graphs: minimizing the partition function, NC Algorithms for Weighted Planar Perfect Matching and Related Problems, Cubic TSP: A 1.3-Approximation, Finding and Recognizing Popular Coalition Structures, Unnamed Item, On the expansion of combinatorial polytopes, The minimal cost maximum matching of a graph, A weight-scaling algorithm for \(f\)-factors of multigraphs, Continuous cutting plane algorithms in integer programming, Efficiently list‐edge coloring multigraphs asymptotically optimally, Data Reduction for Maximum Matching on Real-World Graphs, Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs, Complementability of isometric copies of \(\ell_1\) in transportation cost spaces, On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron, On matchings, T‐joins, and arc routing in road networks, Graph and hypergraph colouring via nibble methods: a survey, A traditional Benders' approach to sports timetabling, An Approximation Algorithm for the Three Depots Hamiltonian Path Problem, Polyhedral techniques in combinatorial optimization: matchings and tours, Expansion of random 0/1 polytopes, Solving maximum weighted matching on large graphs with deep reinforcement learning, A deterministic parallel reduction from weighted matroid intersection search to decision, Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, Weighted connected matchings, The solution of some 100-city travelling salesman problems, Some contributions of Ailsa H. Land to the study of the traveling salesman problem, On Gupta’s Codensity Conjecture, Resonance graphs on perfect matchings of graphs on surfaces, Packing $k$-Matchings and $k$-Critical Graphs, Blocking and anti-blocking pairs of polyhedra, Matroids and the greedy algorithm, Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks, Edmonds polytopes and weakly hamiltonian graphs, Hidden Hamiltonian Cycle Recovery via Linear Programming, Densities, Matchings, and Fractional Edge-Colorings, Surface code quantum computing by lattice surgery, On the Complexity of Holant Problems, Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, An efficient algorithm for minimumk-covers in weighted graphs, Approximating Incremental Combinatorial Optimization Problems, Unnamed Item, A Weighted Linear Matroid Parity Algorithm, On the Circuit Diameter of Some Combinatorial Polytopes, Integer programming approaches to the travelling salesman problem, Extended formulations in combinatorial optimization, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Minimal complete matchings and negative cycles, Computational and statistical tradeoffs via convex relaxation, Unnamed Item, Parameterized Traveling Salesman Problem: Beating the Average, Extended formulations in combinatorial optimization, Graph substitution and set packing polytopes, On the facial structure of set packing polyhedra, Line perfect graphs, Clique-connecting forest and stable set polytopes, On Kuhn's Hungarian Method?A tribute from Hungary, Optimal pricing of capacitated networks, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, Unnamed Item, A polyhedral study of the maximum edge subgraph problem, Graph Stabilization: A Survey, Optimal control of plotting and drilling machines: A case study, Provably good solutions for the traveling salesman problem, Indecomposabler-graphs and some other counterexamples, Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits, Computing the nucleolus of weighted cooperative matching games in polynomial time, When Is the Matching Polytope Box-Totally Dual Integral?, Signed graph factors and degree sequences, Impatient Online Matching, Trustworthy Graph Algorithms (Invited Talk), Approximation algorithms in combinatorial scientific computing, Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Dominants and submissives of matching polyhedra, Unnamed Item, Unnamed Item, Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition, Avoiding 5-Circuits in 2-Factors of Cubic Graphs, On thef-matching polytope and the fractionalf-chromatic index, On the Stable Set Polytope of Claw-Free Graphs, On the Length of Monotone Paths in Polyhedra, Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, Unnamed Item, Unnamed Item, Unnamed Item, Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances, A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation, Properties of vertex packing and independence system polyhedra, Matching, Euler tours and the Chinese postman, Perfect Matchings of Regular Bipartite Graphs, On the cycle polytope of a binary matroid, Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators, On the existence of weak greedy matching heuristics, An efficient matching algorithm applied in statistical physics, Polyhedral proof methods in combinatorial optimization, On the chromatic index of multigraphs and a conjecture of Seymour (I), A separation algorithm for the matchable set polytope, Stable matchings and linear inequalities, Maximum number of disjoint paths connecting specified terminals in a graph, Minimum cost perfect matching with delays for two sources, The complexity of induced minors and related problems, Matrices with the Edmonds-Johnson property, Fractional v. integral covers in hypergraphs of bounded edge size, On perfectly two-edge connected graphs, A polynomial algorithm for b-matchings: An alternative approach, Matching structure and the matching lattice, Multiflows and disjoint paths of minimum total cost, The parsimonious property of cut covering problems and its applications, Subspaces with well-scaled frames, Minimum weight \((T,d)\)-joins and multi-joins, Polyhedral characterizations and perfection of line graphs, The matching problem has no small symmetric SDP, A fast scaling algorithm for the weighted triangle-free 2-matching problem, Parameterized complexity of superstring problems, Some thoughts on combinatorial optimisation, A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective, On certain polytopes associated with graphs, On maximal independent sets of vertices in claw-free graphs, The generalized arc routing problem, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé, Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs., A matching problem with side conditions, Discrete extremal problems, A new linear programming algorithm - better or worse than the simplex method?, On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks, Matchings in regular graphs, A compact linear program for testing optimality of perfect matchings., Adjacent vertices on the b-matching polyhedron, Clique family inequalities for the stable set polytope of quasi-line graphs., Global constraints for round robin tournament scheduling., Matroids and multicommodity flows, Rational and integral \(k\)-regular matrices., Lift and project relaxations for the matching and related polytopes, On the relationship between the biconnectivity augmentation and traveling salesman problems, Total dual integrality and b-matchings, The ellipsoid method and its consequences in combinatorial optimization, On stable set polyhedra for K//(1,3)free graphs, Weakly bipartite graphs and the max-cut problem, Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus, A polyhedral approach to edge coloring, Graph edge coloring: a survey, Euclidean semi-matchings of random samples, Integer flows and cycle covers, Expressing combinatorial optimization problems by linear programs, Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling, Integer programs for logic constraint satisfaction, Chromatic index determined by fractional chromatic index, Solving combinatorial optimization problems using Karmarkar's algorithm, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Polyhedral studies of vertex coloring problems: the standard formulation, On the mixed set covering, packing and partitioning polytope, On two extensions of equimatchable graphs, The traveling purchaser problem and its variants, Matching theory -- a sampler: From Dénes König to the present, Structural properties of matroid matchings, The algorithmic complexity of colour switching, Exact algorithms for the equitable traveling salesman problem, The monotonic diameter of the perfect matching and shortest path polytopes, The complexity of lifted inequalities for the knapsack problem, Structural results on matching estimation with applications to streaming, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, On symmetric subtour problems, A branch-and-cut procedure for the Udine course timetabling problem, A Lagrangian approach for minimum cost single round robin tournaments, Minimum-weight perfect matching for nonintrinsic distances on the line, A note on symmetric doubly-stochastic matrices, Some combinatorial properties of centrosymmetric matrices, A note on 1-factors in certain regular multigraphs, A linear algorithm for disjoint matchings in trees, Sparse regular induced subgraphs in \(2P_3\)-free graphs, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, An identity for matching and skew-symmetric determinant, On the minors of an incidence matrix and Smith normal form, The general routing polyhedron: A unifying framework, The optimal path-matching problem, On the stochastic independence properties of hard-core distributions, The asymmetric traveling salesman problem with replenishment arcs, On a cutting plane heuristic for the stable roommates problem and its applications, Brick decompositions and the matching rank of graphs, A parallel primal-dual simplex algorithm, Survey of facial results for the traveling salesman polytope, Decomposition by clique separators, On the \(k\)-systems of a simple polytope, A 2-approximation algorithm for the minimum weight edge dominating set problem, Fractionally colouring total graphs, On the use of optimal fractional matchings for solving the (integer) matching problem, Packings by cliques and by finite families of graphs, An efficient Dijkstra-like labeling method for computing shortest odd/even paths, A lower bound to the complexity of Euclidean and rectilinear matching algorithms, Some sequences associated with combinatorial structures, Graph realizations constrained by skeleton graphs, Integer round-up property for the chromatic number of some \(h\)-perfect graphs, A revival of the girth conjecture, Tutte sets in graphs. II: The complexity of finding maximum Tutte sets, The story of perfectly orderable graphs, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), New primal and dual matching heuristics, Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers, Nowhere-zero unoriented 6-flows on certain triangular graphs, An approximation algorithm for solving the heterogeneous Chinese postman problem, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Constrained random matching, What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs, Two dimensional maximum weight matching using Manhattan topology, On two-connected subgraph polytopes, Classes of linear programs solvable by coordinate-wise minimization, A simple method for convex optimization in the oracle model, The limits of local search for weighted \(k\)-set packing, Revisiting a cutting-plane method for perfect matchings, NP-hardness of \(m\)-dimensional weighted matching problems, Resolution of indecomposable integral flows on signed graphs, A new pivoting strategy for Gaussian elimination, Ejection chains, reference structures and alternating path methods for traveling salesman problems, The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \), General network design: a unified view of combined location and network design problems, The stochastic shortest path problem: a polyhedral combinatorics perspective, When the Gomory-chvátal closure coincides with the integer hull, Additive stabilizers for unstable graphs, An algorithmic approach to dual integrality of matching and extensions, Integrality gaps for colorful matchings, On tail dependence matrices. The realization problem for parametric families, Independence and matching number of some graphs, A weighted independent even factor algorithm, An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem, Weighted inverse maximum perfect matching problems under the Hamming distance, Polyhedron of triangle-free simple 2-matchings in subcubic graphs, Some \(0/1\) polytopes need exponential size extended formulations, Stronger instruments via integer programming in an observational study of late preterm birth outcomes, Independence and matching number in graphs with maximum degree 4, A unified approach to distance-two colouring of graphs on surfaces, Short cycle covers of graphs with at most 77\% vertices of degree two, Isolation, matching, and counting uniform and nonuniform upper bounds, 2-clique-bond of stable set polyhedra, The traveling salesman problem on cubic and subcubic graphs, Bi-criteria and approximation algorithms for restricted matchings, An upper bound for the chromatic number of line graphs, Optimal placement of stereo sensors, Approximation algorithms for some min-max postmen cover problems, Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs, A computational study on the maximum-weight bounded-degree rooted tree problem, Maximum weight edge-constrained matchings, Largest 2-regular subgraphs in 3-regular graphs, On characterizing the critical graphs for matching Ramsey numbers, Small snarks with large oddness, On the fractional chromatic index of a graph and its complement, A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems, Even factors of graphs, \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem, A constructive heuristic for the undirected rural postman problem, Strong IP formulations need large coefficients, Covering partially directed graphs with directed paths, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), On the commutativity of antiblocker diagrams under lift-and-project operators, Facets of the independent path-matching polytope, Coordinating resources in Stackelberg security games, Separation routine and extended formulations for the stable set problem in claw-free graphs, A new approximate cluster deletion algorithm for diamond-free graphs, Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut, A genetic-based framework for solving (multi-criteria) weighted matching problems., Fractional matroid matchings, Matchings and covers in hypergraphs, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Synchronized pickup and delivery problems with connecting FIFO stack, Short trading cycles: paired kidney exchange with strict ordinal preferences, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Combinatorial optimization and small polytopes, Fractional matching preclusion number of graphs and the perfect matching polytope, Strengthened clique-family inequalities for the stable set polytope, Polynomial size linear programs for problems in \textsc{P}, Detecting strong cliques, A cutting plane algorithm for minimum perfect 2-matchings, On dual integrality in matching problems, Facets and algorithms for capacitated lot sizing, Solving combinatorial problems with combined min-max-min-sum objective and applications, Approximate minimum weight matching on points in k-dimensional space, Computing in combinatorial optimization, Relations between global forcing number and maximum anti-forcing number of a graph, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem, Remarque sur le polytope des couplages d'Edmonds, Continuous cubic formulations for cluster detection problems in networks, Priority matchings revisited, A generalization of extension complexity that captures P, Linear-time parameterized algorithms with limited local resources, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices, A framework for the verification of certifying computations, Group irregularity strength of connected graphs, Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs, Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles, Unions of perfect matchings in \(r\)-graphs, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Improving a constructive heuristic for the general routing problem, Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality, Edge-colouring graphs with local list sizes, The core conjecture of Hilton and Zhao, How many matchings cover the nodes of a graph?, (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings, Graphs with independent perfect matchings, Solving matching problems with linear programming, Comparing Imperfection Ratio and Imperfection Index for Graph Classes, Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm, Query Complexity in Expectation, Factors and factorizations of graphs—a survey, Binary group and Chinese postman polyhedra, Node-Balancing by Edge-Increments, The Price of Matching with Metric Preferences, Randomized parameterized algorithms for the kidney exchange problem, SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT, A note on shortest cycle covers of cubic graphs, New techniques for cost sharing in combinatorial optimization games, Recognizing binet matrices, Colouring series-parallel graphs, Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point, Packings by Complete Bipartite Graphs, Generating bricks, Linear-Time Approximation for Maximum Weight Matching, A two-dimensional strip cutting problem with sequencing constraint, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, Coupled-Tasks in Presence of Bipartite Compatibilities Graphs, A generalized linear production model: A unifying model, Matching problems with generalized upper bound side constraints, An Eulerian exposition, A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem, Hyperbolic surface subgroups of one-ended doubles of free groups, Extending an edge-coloring, Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies, The restricted Chinese postman problems with penalties, On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, Total coloring and total matching: polyhedra and facets, On the facets of stable set polytopes of circular interval graphs, Some complexity and approximation results for coupled-tasks scheduling problem according to topology, Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design, A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs, Box-total dual integrality and edge-connectivity, Characterizing N+-perfect line graphs, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming, Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two, Solving large-scale matching problems efficiently: A new primal matching approach, Faces for a linear inequality in 0–1 variables, An equivalent formulation of the Fan-Raspaud Conjecture and related problems, Odd Multiway Cut in Directed Acyclic Graphs, TSP on Cubic and Subcubic Graphs, Optimal Matching Forests and Valuated Delta-Matroids, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem, Fractional covers for forests and matchings, A new algorithm for general matching problems using network flow subproblems, Reductions to 1–matching polyhedra, Dynamic matchings and quasidynamic fractional matchings. I, Dynamic matchings and quasidynamic fractional matchings. II, Unnamed Item, Unnamed Item, Locating a cycle in a transportation or a telecommunications network, On the symmetric travelling salesman problem I: Inequalities, Duality and admissible transformations in combinatorial optimization, Tutte sets in graphs I: Maximal tutte sets and D-graphs, Balanced network flows. VII. Primal-dual algorithms, Minimum node covers and 2-bicritical graphs, Una variante del algoritmo de Edmonds para acoplamientos Maximos, The Cutting Plane Method is Polynomial for Perfect Matchings, A domination algorithm for {0,1}-instances of the travelling salesman problem, Optimal edge-coloring with edge rate constraints, Maximal matching polytope in trees, Some polyhedra related to combinatorial problems, Heuristically guided search and chromosome matching, Efficient Matching for Column Intersection Graphs, Integer programming duality: Price functions and sensitivity analysis, Efficient Approximation Algorithms for Weighted $b$-Matching, Anti-blocking polyhedra, Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor, Establishing the matching polytope, Lovász-Schrijver PSD-Operator on Claw-Free Graphs, Edmonds polytopes and a hierarchy of combinatorial problems, A Characterization of Graphs with Fractional Total Chromatic Number Equal to, Rank of maximum matchings in a graph, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, Sensitivity analysis of optimal matchings, On characterizing Vizing's edge colouring bound, Path problems in skew-symmetric graphs, Matching polytopes and Specht modules, A shortest augmenting path method for solving minimal perfect matching problems, Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time, Characterising claw-free t-perfect graphs, Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems, An analysis of alternative strategies for implementing matching algorithms, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, Frutex y caminos nodales, The traveling salesman problem: An update of research, A note about shortest cycle covers, Unions of perfect matchings in cubic graphs, Generalized clique family inequalities for claw-free graphs, On facets of stable set polytopes of claw-free graphs with stability number three, A 1-matching blossom-type algorithm for edge covering problems, Optimal set partitioning, matchings and lagrangian duality
