Over the past several decades, the optimization over the efficient set has seen a substantial
development. The aim of this paper is to provide a state-of-the-art survey of the …

The efficient set of a linear multicriteria programming problem can be represented by a
reverse convex constraint of the form g (z)≤ 0, where g is a concave function. Consequently …

The network flow theory and algorithms have been developed on the assumption that each
arc flow is controllable and we freely raise and reduce it. We however consider in this paper …

This paper concerns an optimization problem over the efficient set of a multiobjective linear
programming problem. We propose and solve an equivalent mixed integer programming …

Given an undirected graph, the problem of finding a maximal matching that has minimum
total weight is NP-hard. This problem has been studied extensively from a graph theoretical …

The problem of minimizing the flow value attained by maximal flows plays an important and
interesting role to investigate how inefficiently a network can be utilized. It is a typical …

This paper concerns a minimum maximal flow (MMF) problem, which finds a minimum
maximal flow in a given network. The problem is known to be NP-hard. We show that the …

We formulate minmax flow problems as a DC optimization problem. We then apply a DC
primal-dual algorithm to solve the resulting problem. The obtained computational results …

XVeare givena connect/ed ne'I, work< V, s, t, ll), c), where V ist/hese't] of m+ 2･ nodes
colltaining t/hesource node s and the sink node t. E isthe set of n arcs and c is the n …

Optimizing a function over an efficient set is an interesting approach in decision-making
situations. It helps a decision-maker to discriminate among efficient solutions and choose his …