Minimum cost \(b\)-matching problems with neighborhoods (Q2082547): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q114227011, #quickstatements; #temporary_batch_1722794872778
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-022-00406-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4292818947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Touring Disjoint Polygons Problem Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for b-matchings: An alternative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered \(p\)-median problems with neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition algorithms for solving the minimum weight maximal matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP with neighborhoods of varying size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum- and maximum-weight minimum spanning trees with neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Touring a sequence of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical \(b\)-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem with neighbourhoods: MINLP solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and nonlinear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Matching Algorithms for Points on a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing for unmanned aerial vehicles: touring dimensional sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations for the minimum weighted maximal matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable combinatorial auctions and \(b\)-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matching polytope in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Spanning Tree with Neighborhoods / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114227011 / rank
 
Normal rank

Latest revision as of 19:11, 4 August 2024

scientific article
Language Label Description Also known as
English
Minimum cost \(b\)-matching problems with neighborhoods
scientific article

    Statements

    Minimum cost \(b\)-matching problems with neighborhoods (English)
    0 references
    0 references
    4 October 2022
    0 references
    matching
    0 references
    neighborhoods
    0 references
    SOC formulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers