A dynamic programming algorithm for the local access telecommunication network expansion problem
Article Abstract:
Research is presented concerning the the development of a dynamic programming algorithm to model the local access network expansion problems associated with a telecommunication network.
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:
The assembly of printed circuit boards: a case with multiple machines and multiple board types
Article Abstract:
A heuristic approach to solving a common problem in the manufacture of printed circuit boards is presented. The problem involved the the assembly of different types of printed circuit boards using only a single line of placement machines. Decomposition of the main problem yielded a host of subproblems, the most important of which was the formulation of a feeder rack assignment that will result in an efficient placement sequence for each board type. The solution was subjected to real-life production testing where it proved its worth in enhancing efficiency.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Generalized semi-infinite programming: theory and methods
Article Abstract:
A study has been conducted to examine generalized semi-infinite optimization problems (GSIP) and to try to illustrate the difference between GSIP and standard semi-infinite problems (SIP). Illustrated examples reveal that Chebyshev approximation problems lead to semi-infinite problems and GSIP. Finding indicate that the numerical solution of GSIP can be more difficult than the solution for SIP. The transformation of GSIP to SIP may be possible if in all points of Y(x) the Mangasarian Fromovitz Constraint Qualification is satisfied.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem
- Abstracts: Waiting for the call: access to the Internet is in great demand. How should it be priced? Living in freefall
- Abstracts: British Telecommunications launches 9.7 billion euros offering. BT's $8.5 billion offering dominates Eurobond trading
- Abstracts: Flow shop and open shop scheduling with a critical machine and two operations per job. A note on scheduling flowshops with flexible stage ordering
- Abstracts: Stochastically minimizing total flowtime in flowshops with no waiting space. Minimizing maximum lateness with job families