An exact method to generate all nondominated spanning trees

DOI10.1051/ro/2016060zbMath1358.90110OpenAlexW2509095255MaRDI QIDQ2954355

Mohamed El-Amine Chergui, Asma Boumesbah

Publication date: 12 January 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2016060

zbMATH Keywords

combinatorial optimizationinteger linear programmingminimum spanning treebranch and bound methodmultiple objective linear optimization

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient spanning trees
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• A bicriterion shortest path algorithm
• On spanning tree problems with multiple objectives
• Variable neighborhood search
• Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
• Multi-objective integer programming: an improved recursive algorithm
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

This page was built for publication: An exact method to generate all nondominated spanning trees