Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Minimal k-Vertex Connected Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the rooted connectivity of a digraph by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / 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: Properties of two DC algorithms in quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty and error bounds in DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Relaxation for Discrete DC Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework of discrete DC programming by discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780016 / 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: On local search in d.c. optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / 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: The Design of Approximation Algorithms / rank
 
Normal rank

Revision as of 15:06, 15 July 2024

scientific article
Language Label Description Also known as
English
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
scientific article

    Statements

    Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2018
    0 references
    fault-tolerant
    0 references
    connectivity
    0 references
    DC programming
    0 references
    convex function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers