F. Sibel Salman

Learn More
Motivated by a real world application, we study the multiple knapsack problem with assignment restrictions (MKAR). We are given a set of items, each with a positive real weight, and a set of knapsacks, each with a positive real capacity. In addition, for each item a set of knapsacks that can hold that item is specified. In a feasible assignment of items to(More)
1 Introduction. We initiate the algorithmic study of an important but NP-hard problem that arises commonly in network design. The input consists of (1) An undirected graph with one sink node and multiple source nodes, a specified length for each edge, and a specified demand, dem,, for each source node v. (2) A small set of cable types, where each cable type(More)
We study a capacitated network design problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support the flow at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a(More)
The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling The input consists of a set of markets and a set of products Each market o ers a price for each product and there is a cost associated with traveling from one market to another The problem(More)
We combine the results of Bartal [Proc. 37th FOCS, 1996, pp. 184–193] on probabilistic approximation of metric spaces by tree metrics, with those of Klein, Plotkin and Rao [Proc. 25th STOC, 1993, pp. 682–690] on decompositions of graphs without small Ks,s minors (such as planar graphs) to show that metrics induced by such graphs (with unit lengths on the(More)
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes to a sink node and to install transmission facilities on the edges of the graph to accommodate the flow at minimum cost. We give a branch and bound algorithm that solves relaxations(More)
We initiate the algorithmic study of an important but NP hard problem that arises commonly in network design The input consists of An undirected graph with one sink node and multiple source nodes a speci ed length for each edge and a speci ed demand demv for each source node v A small set of cable types where each cable type is speci ed by its capacity and(More)