We consider nonlinear nonconvex capacitated transportation problems where the nonlinearity occurs only in the last row of the transportation tableau. This transportation model can be successfully applied to economics representing the nonlinearity caused by penalties for unsatis®ed contractual quantities or by changing in price. An algorithm for local optimization, based on the algorithms for so...

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

in this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. we consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. the transportation system arises in the form of a star/star net...

Multi-echelon distribution systems are quite common in supply-chain and logistic management. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. In the literature, most studies address issues related to the movement of flows throughout the system from the origins to their final destinations....

In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...

The Multi-Commodity Capacitated Multi-facility Weber Problem (MCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers for K commodities with the minimum total transportation cost. The MCMWP is a non-convex optimization problem. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which de...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...

Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into served clients, paying the transportation cost to serve them. We give polynomial-time reductions from this problem and variants to the (un)capacitated facilit...