New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem

The Multiobjective Minimum Spanning Tree (MO-MST) problem generalizes the Minimum Spanning Tree problem by weighting the edges of the input graph using vectors instead of scalars. In this paper, we design a new Dynamic Programming MO-MST algorithm. Dynamic Programming for a MO-MST instance requests...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 173; p. 106852
Main Authors:	Maristany de las Casas, Pedro, Sedeño-Noda, Antonio, Borndörfer, Ralf
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.01.2025
Subjects:	Dynamic Programming Multiobjective Minimum Spanning Trees Multiple objective programming Dynamic Programming Multiobjective Minimum Spanning Trees Multiple objective programming
ISSN:	0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!