The minimum cut and maximum flow problems form a well-known pair of dual problems providing a min-max relation. Similarly, the continuous relaxation of the minimum multicut problem is the linear dual ...

By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...