On solving bi-objective constrained minimum spanning tree problems (Q6166107): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bounded-angle spanning tree: modeling networks with angular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949834 / 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: Solving diameter-constrained minimum spanning tree problems by constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the minimum-cost bounded-error calibration tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / 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: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733693 / 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: Dynamic programming for spanning tree problems: application to the multi-objective case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for the multiobjective minimum spanning tree / 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: A multi-agent transgenetic algorithm for the bi-objective spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical study of exact algorithms for the multi-objective spanning tree / 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: Modeling and solving the bi-objective minimum diameter-cost spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for solving the bi-objective Minimum Diameter-Cost 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree minimum-radius spanning trees in wireless sensor networks / 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: Survey of multi-objective optimization methods for engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in multiple objective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of variance test for normality (complete samples) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized multiple objective bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing branch‐and‐price for constrained tree problems / rank
 
Normal rank

Revision as of 12:17, 2 August 2024

scientific article; zbMATH DE number 7721400
Language Label Description Also known as
English
On solving bi-objective constrained minimum spanning tree problems
scientific article; zbMATH DE number 7721400

    Statements

    On solving bi-objective constrained minimum spanning tree problems (English)
    0 references
    0 references
    0 references
    2 August 2023
    0 references
    multiple objective programming
    0 references
    hop-constrained minimum spanning tree
    0 references
    delay-constrained minimum spanning tree
    0 references
    augmented \(\epsilon\)-constraint
    0 references
    bottleneck objective function
    0 references
    MTZ constraints
    0 references
    0 references
    0 references
    0 references

    Identifiers