A branch-and-price procedure for clustering data that are graph connected (Q2060392): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Diego Ponce / rank
 
Normal rank
Property / author
 
Property / author: Antonio M. Rodríguez-Chía / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3169090950 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2104.05454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering data that are graph connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multisource hyperplanes location problem to fitting set of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding cohesion constraints to models for modularity maximization in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noising methods for a clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large attributed information networks: an efficient incremental computing approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems for machine learning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint programming-based column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking for edge-equitable spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and clustering: A combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based hybrid metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time freight locomotive rescheduling and uncovered train detection during disruption / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs / rank
 
Normal rank

Latest revision as of 12:18, 27 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-price procedure for clustering data that are graph connected
scientific article

    Statements

    A branch-and-price procedure for clustering data that are graph connected (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    combinatorial optimization
    0 references
    clustering
    0 references
    mixed integer programming
    0 references
    branch-and-price
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references