A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
From MaRDI portal
Publication:4291501
DOI10.1287/ijoc.6.1.68zbMath0798.90128MaRDI QIDQ4291501
Joseph F. Pekny, Donald L. Miller
Publication date: 10 May 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.1.68
90C35: Programming involving graphs or networks
90C06: Large-scale problems in mathematical programming
Related Items
A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Estimation-based metaheuristics for the probabilistic traveling salesman problem, New differential approximation algorithm for \(k\)-customer vehicle routing problem, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, Lower bounding techniques for frequency assignment, A bound for the symmetric travelling salesman problem through matroid formulation, Generation of lower bounds for minimum span frequency assignment, Approximation algorithms for some vehicle routing problems, A \(\frac78\)-approximation algorithm for metric Max TSP, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, An approximation algorithm for maximum triangle packing
Uses Software
