Odd cycles and a class of facets of the axial 3-index assignment polytope
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network between...
On designing connected rapid transit networks reducing the number of transfers
In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum...
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
For a family of maps , d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.
On the solution of a class of location problems. A sample problem
Optimal Distribution Centers Involving Supply Capacity, Demands and Budget Restriction
Optimal Location of Production Centers Interconnected Materials and Products Allocation