Two‐phase strategies for the bi‐objective minimum spanning tree problem
From MaRDI portal
Publication:6060666
DOI10.1111/itor.13120OpenAlexW4210881681MaRDI QIDQ6060666
Publication date: 29 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13120
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- A preference-based approach to spanning trees and shortest paths problems
- Efficient spanning trees
- A comparison of solution strategies for biobjective shortest path problems
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Using separation algorithms to generate mixed integer model reformulations
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- On spanning tree problems with multiple objectives
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A new approach for the multiobjective minimum spanning tree
- The vector linear program solver Bensolve -- notes on theoretical background
- Ordered weighted average optimization in multiobjective spanning tree problem
- The problem of the optimal biobjective spanning tree
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- A discussion of scalarization techniques for multiple objective integer programming
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Two phase algorithms for the bi-objective assignment problem
- PolySCIP
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
- Geometric Duality in Multiple Objective Linear Programming
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Multi‐objective combinatorial optimization problems: A survey
- Multicriteria Optimization
- The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction
- Wastewater treatment technology selection using a hybrid multicriteria decision‐making method
- Multiobjective land–water allocation model for sustainable agriculture with predictive stochastic yield response
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
This page was built for publication: Two‐phase strategies for the bi‐objective minimum spanning tree problem
