Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (Q842713): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AS 136 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: impute / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-008-9393-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067346424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm AS 136: A K-Means Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in projection and clustering by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Decomposition and Data Reorganization by a Clustering Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Clustering a Data Array and the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Simple Applications of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an ordering into a partition to minimize diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow model for biclustering via optimal re-ordering of data matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large quadratic assignment problems on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction of oligopeptide conformations via deterministic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ab initio tertiary structure prediction of proteins / rank
 
Normal rank

Latest revision as of 00:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
scientific article

    Statements

    Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem (English)
    0 references
    25 September 2009
    0 references
    0 references
    clustering
    0 references
    mixed-integer linear programming
    0 references
    sparse data sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references