Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116): Difference between revisions

From MaRDI portal
Changed an 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: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Benchmarks for Optimization Software / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparsePOP / 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-012-9924-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117439791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive tabu-simulated annealing for concave cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for hard multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the min concave cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the representation of positive polynomials with structured sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global search algorithms for minimum concave-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing underlying sparsity in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian based branch-and-bound algorithm for production-transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for minimum concave cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independent benchmarking of SDP and SOCP solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal psd forms with few terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic local search algorithms for concave cost transportation network problems / rank
 
Normal rank

Latest revision as of 16:29, 6 July 2024

scientific article
Language Label Description Also known as
English
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
scientific article

    Statements

    Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (English)
    0 references
    0 references
    0 references
    1 August 2013
    0 references
    transportation problem
    0 references
    concave cost minimization
    0 references
    SDP relaxation
    0 references
    sparsity
    0 references
    change of variables
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers