An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4325280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm for the multi-criteria minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent developments in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees / 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: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the diameter constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving diameter-constrained minimum spanning tree problems by constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy heuristics for the diameter-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all efficient solutions of the biobjective minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of multicriteria analysis / rank
 
Normal rank

Revision as of 23:56, 9 July 2024

scientific article; zbMATH DE number 6430723
Language Label Description Also known as
English
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
scientific article; zbMATH DE number 6430723

    Statements

    An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (English)
    0 references
    27 April 2015
    0 references
    spanning trees
    0 references
    multi-objective optimization
    0 references
    parallel partitioning method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references