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 ...

We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m1+o (1) time. Our ...

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distance, and universal ...

In this paper, we also present a mathematical programming method in which a mixed integer linear programming model for a minimum backbone grid is proposed. A minimum number of branches and maximum ...

Learn how to relate LP duality to game theory and the minimax theorem, which are useful for optimizing and analyzing strategic situations.

A linear programming problem is one that is concerned with finding the optimal value (maximum or minimum) of a linear function of several variables (called objective function) subject to the ...