6 search results - page 1 / 2 » A Branch and Price algorithm for the k-splittable maximum fl... |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
DISOPT
2008
13 years 3 months ago
2008
AAAI
2010
13 years 6 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...