A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (Q833641): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.advengsoft.2009.03.003 / rank
Normal rank
 
Property / author
 
Property / author: Jafar Razmi / rank
Normal rank
 
Property / author
 
Property / author: Jafar Razmi / 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.1016/j.advengsoft.2009.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025223483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3607719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sandwich approximation of univariate convex functions with an application to separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance comparison of memetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex curves with application to the bicriterial minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective minimum cost flow problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria network flow problems: Continuous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solutions for the bicriteria network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for convex curve approximation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ADVENGSOFT.2009.03.003 / rank
 
Normal rank

Latest revision as of 04:34, 10 December 2024

scientific article
Language Label Description Also known as
English
A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
scientific article

    Statements

    A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (English)
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    bi-objective minimum cost flow
    0 references
    memetic algorithm
    0 references
    simulated annealing
    0 references
    hybrid meta heuristic
    0 references

    Identifiers