The all-to-all alternative route problem
The Application of GIS and ITS Components in Tourism
The Application of Rosenbrock-Wanner Type Methods with Stepsize Control in Differential-Algebraic Equations.
The assignment problem with three job categories
The behavior of a Markov network with respect to an absorbing class: the target algorithm
In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a “target” set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating...
The Bellman equation related to the minimal entropy martingale measure.
The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem
The block plan problem. A graphtheoretic approach
The boundary of weighted analytic centers for linear matrix inequalities.
The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...
The busy period of a repairman for redundant repairable systems
The Capacitated Arc Routing Problem. A heuristic algorithm.
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity.A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads not exceeding the vehicle...
The capacitated newsboy problem with revenue sharing.
The Chain-Interchange Heuristic Method
The color-balanced spanning tree problem
Suppose a graph whose edges are partitioned into disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number of categories and present some polynomial algorithm.
The complexity of short schedules for uet bipartite graphs
The complexity of short schedules for uet bipartite graphs
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
The complexity of the travelling repairman problem
The constrained gravity model with power function as a cost function.
The Construction of the Firm’S Performance Evaluation Model on Outsourcing Activities - Application of the Fuzzy Synthesis