Minimum cost \(b\)-matching problems with neighborhoods
type: Item
instance of: scholarly article
title: Minimum cost \(b\)-matching problems with neighborhoods
zbMATH Open document ID: 1502.90145
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7596182
zbMATH Keywords: matching
zbMATH Keywords: neighborhoods
zbMATH Keywords: SOC formulations
describes a project that uses: Gurobi
describes a project that uses: PARDISO
MaRDI profile type: Publication
full work available at URL: s10589-022-00406-7
OpenAlex ID: W4292818947
cites work: Touring Disjoint Polygons Problem Is NP-Hard
cites work: A polynomial algorithm for b-matchings: An alternative approach
cites work: Approximation algorithms for the Geometric Covering Salesman Problem
cites work: Disjunctive Programming
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Ordered \(p\)-median problems with neighbourhoods
cites work: Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
cites work: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
cites work: Decomposition algorithms for solving the minimum weight maximal matching problem
cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
cites work: Q4197644
cites work: TSP with neighborhoods of varying size
cites work: On minimum- and maximum-weight minimum spanning trees with neighborhoods
cites work: Touring a sequence of polygons
cites work: Approximation algorithms for TSP with neighborhoods in the plane
cites work: Paths, Trees, and Flowers
cites work: Hierarchical \(b\)-matching
cites work: Data Structures for Weighted Matching and Extensions to b -matching and f -factors
cites work: The travelling salesman problem with neighbourhoods: MINLP solution
cites work: Q4845365
cites work: Q4948735
cites work: Matching theory
cites work: Applications of second-order cone programming
cites work: Linear and nonlinear programming.
cites work: Fast Matching Algorithms for Points on a Polygon
cites work: A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
cites work: Routing for unmanned aerial vehicles: touring dimensional sets
cites work: Q4871750
cites work: Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
cites work: Optimization with disjunctive constraints
cites work: Integer programming formulations for the minimum weighted maximal matching problem
cites work: Tractable combinatorial auctions and \(b\)-matching
cites work: Maximal matching polytope in trees
cites work: Geometry Helps in Matching
cites work: Minimum Spanning Tree with Neighborhoods
Wikidata QID: Q114227011
DOI: 10.1007/S10589-022-00406-7
description: scientific article; zbMATH DE number 7596182