Minimum cost \(b\)-matching problems with neighborhoods
From MaRDI portal
Publication:2082547
DOI10.1007/s10589-022-00406-7zbMath1502.90145OpenAlexW4292818947WikidataQ114227011 ScholiaQ114227011MaRDI QIDQ2082547
Publication date: 4 October 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00406-7
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Hierarchical \(b\)-matching
- Linear and nonlinear programming.
- Matching theory
- A polynomial algorithm for b-matchings: An alternative approach
- Applications of second-order cone programming
- Optimization with disjunctive constraints
- Approximation algorithms for the Geometric Covering Salesman Problem
- Tractable combinatorial auctions and \(b\)-matching
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Integer programming formulations for the minimum weighted maximal matching problem
- Routing for unmanned aerial vehicles: touring dimensional sets
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Ordered \(p\)-median problems with neighbourhoods
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Lectures on Modern Convex Optimization
- Decomposition algorithms for solving the minimum weight maximal matching problem
- Maximal matching polytope in trees
- Touring Disjoint Polygons Problem Is NP-Hard
- Geometry Helps in Matching
- Touring a sequence of polygons
- Fast Matching Algorithms for Points on a Polygon
- Disjunctive Programming
- Approximation algorithms for TSP with neighborhoods in the plane
- Data Structures for Weighted Matching and Extensions to b -matching and f -factors
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- The travelling salesman problem with neighbourhoods: MINLP solution
- Paths, Trees, and Flowers
- Minimum Spanning Tree with Neighborhoods
- TSP with neighborhoods of varying size
This page was built for publication: Minimum cost \(b\)-matching problems with neighborhoods
