In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This finds minimum ‘distance’ from reference point, usually taken as vertex current approximation, upper image through given direction. We propose efficient methods select parameters (the point an...

The D irected S teiner N etwork (DSN) problem takes as input a directed graph G =( V , E ) with non-negative edge-weights and set ⊆ × of k demand pairs. aim is to compute the cheapest network N⊆ for which there an s\rightarrow t path each ( s )∈ D. It known that this notoriously hard, no 1/4− o (1) -approximation algorithm under Gap-ETH, even when parametrizing runtime by [Dinur & Manurangs...