We address the algorithmic complexity of a profit maximization problem in capacitated, undirected networks. We are asked to price a set of m capacitated network links to serve a set of n potential customers. Each customer is interested in purchasing a network connection that is specified by a simple path in the network and has a maximum budget that we assume to be known to the seller. The goal ...

In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...

This article poses the following problem: Does there exist a probability distribution over subsets of finite partially ordered set (poset), such that constraints involving marginal probabilities poset’s elements and maximal chains is satisfied? We present combinatorial algorithm to positively resolve this question. The can be implemented in polynomial time special case where chain are affine fu...

Many practical problems arising in real world applications, mainly in the fields of logistics and telecommunications, can be modeled as network design or vehicle routing problems. In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transpo...

Motivated by a planned automated cargo transportation network, we consider transportation problems in which the finite capacity of resources has to be taken into account. We present a flexible modeling methodology which allows to construct, evaluate, and improve feasible solutions. The modeling is evaluated on instances stemming from a simulation model of the planned cargo transportation system.

The problem of finding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links. This paper reports on our design, implementation and performance evaluation of a hybrid Ant Colony Optimization algorithm for finding Capacitated Minimum Spanning Trees. Our Ant Colony Optimization ...

the objective of this study was to develop a cost minimizing pattern for cube sugar and sugar transportation from production centers to refinement and storage centers and finally to distribution and consumption  centers in  fars province. producing centers are marvdasht (27.3%), eghlid (27.9%), fasa (11.3%), kavar (7.3%) and mamasani (20.2%). some of the province’s cube sugar and sugar is provi...

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loa...

Abstract. Location-allocation is a key tool within the GIS and network analysis toolbox. In this paper we discuss real world application of location-allocation case study (approx 800 students, 500 schools) from UCL using public transport. The use transportation for study, as many approaches only make drive-time or walking-time distances, but location in Greater London, UK makes inclusion transp...