DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations of the multiple sequence alignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower energy icosahedral atomic clusters with incomplete core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for Lennard-Jones atomic clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5818996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate energy minimization for large Lennard-Jones clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Quadratic Programming Models in Computational Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to sequence alignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming and DCA for General DC Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution for optimization over the efficient set by d.c. optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approch for globally solving linearly constrained quadratic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DC Programming Approaches for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DCA based algorithms for multiple sequence alignment (MSA) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for large scale global optimization: Lennard-Jones clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for local alignment search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum inter-particle distance at global minimizers of Lennard-Jones clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank

Latest revision as of 23:26, 9 July 2024

scientific article; zbMATH DE number 6424678
Language Label Description Also known as
English
DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
scientific article; zbMATH DE number 6424678

    Statements

    DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (English)
    0 references
    0 references
    14 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers