On solving bi-objective constrained minimum spanning tree problems
From MaRDI portal
Publication:6166107
DOI10.1007/s10898-023-01295-8OpenAlexW4378227366MaRDI QIDQ6166107
Amadeu Almeida Coco, Iago A. Carvalho
Publication date: 2 August 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-023-01295-8
multiple objective programmingbottleneck objective functionaugmented \(\epsilon\)-constraintdelay-constrained minimum spanning treehop-constrained minimum spanning treeMTZ constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Survey of multi-objective optimization methods for engineering
- Generalized multiple objective bottleneck problems
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Bounded-angle spanning tree: modeling networks with angular constraints
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- Efficient spanning trees
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multicommodity flow models for spanning trees with hop constraints
- A new approach for the multiobjective minimum spanning tree
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Dynamic programming for spanning tree problems: application to the multi-objective case
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- An exact approach for the minimum-cost bounded-error calibration tree problem
- Empirical study of exact algorithms for the multi-objective spanning tree
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- Integer Programming Formulation of Traveling Salesman Problems
- Minimum Diameter Spanning Trees and Related Problems
- Efficiency in multiple objective optimization problems
- Bicriteria Network Design Problems
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
- Stabilizing branch‐and‐price for constrained tree problems
- An analysis of variance test for normality (complete samples)
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
This page was built for publication: On solving bi-objective constrained minimum spanning tree problems
