Topological design of computer communication networks - the overall design problem
Article Abstract:
Mathematical models for the topological design ofcomputer communication networks are presented. Nonlinear combinatorial optimization and Lagrangean processes are used to create optimal solutions to computer network topological design involving network control processor (NCP) location, selection of backbone links for NCPs, linking end user nodes to NCPs and routing to support communications between communicating end user node pairs Effectivity of the models is proven by applications to networks with 200 end user nodes and up to 30 NCP locations.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
A heuristic procedure for the crew rostering problem
Article Abstract:
A heuristic for the even distribution of workload among drivers in a mass transit system is presented. The problem is modeled using integer programming and the iterative heuristic algorithm using a lower bound is derived. The algorithm solves the multilevel bottleneck assignment problem yielding asymptotically optimal solutions. Comparison with an existing model shows the superiority of the heuristic for rostering problems with planning periods of less than 10 days, despite longer computing time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
The asymmetric traveling salesman problem with replenishment arcs
Article Abstract:
A constrained asymmetric traveling salesman problem with certain knapsack constraints is considered.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An application of genetic algorithms for flow shop problems. A primal partitioning approach for single and non-simultaneous multicommodity flow problems
- Abstracts: Random pseudo-polynomial algorithms for some combinatorial programming problems. Unbounded knapsack problem: Dynamic programming revisited