Titlebook: Integer Programming and Combinatorial Optimization; 16th International C Michel Goemans,José Correa Conference proceedings 2013 Springer-Ve

GENRE

SLAG

脖子

bronchiole

Intrepid

MIRE

Blocking Optimal Arborescences, In this paper we show that the following special case is solvable in polynomial time: given a digraph .?=?(.,.) with a designated root node .?∈?. and arc-costs .:.?→??, find a minimum cardinality subset . of the arc set . such that . intersects every minimum .-cost .-arborescence. The algorithm we

施魔法

演講

A Complexity and Approximability Study of the Bilevel Knapsack Problem, weight and profit coefficients in the knapsack problem are encoded in unary, then two of the bilevel variants are solvable in polynomial time, whereas the third is NP-complete. Furthermore we design a polynomial time approximation scheme for this third variant, whereas the other two variants cannot

運(yùn)氣

Matroid and Knapsack Center Problems,vertex to its closest center is minimized. In this paper, we consider two important generalizations of .-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows

激勵(lì)