The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053832189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant colony optimization for vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic annealing algorithm for the minimum concave cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions for general concave minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the nonlinear resource allocation problem / rank
 
Normal rank

Latest revision as of 21:15, 9 July 2024

scientific article
Language Label Description Also known as
English
The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
scientific article

    Statements

    The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (English)
    0 references
    25 March 2015
    0 references
    minimum spanning tree
    0 references
    network flows
    0 references
    hop-constraints
    0 references
    nonlinear costs
    0 references
    ant colony optimization
    0 references
    local search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers