Computing closely matching upper and lower bounds on textile nesting problems
Article Abstract:
Algorithms were developed to compute the upper and lower bounds of textile nesting problems. Quality results were obtained by the hodograph-based greedy strategies upon its implementation on upper bounds. Such strategies took less than an hour on a usual-day workstation to compute the upper bounds. Meanwhile, a simulated annealing-based global optimization developed took a few hours to compute for the problem's lower bounds.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Goal network programs: a specialized algorithm and an application
Article Abstract:
A specialized algorithm was formulated to resolve pure goal network programs with preemptive priorities. Unlike a sequential linear goal programming approach, the specialized procedure is more efficient in dealing with pure goal network programs since entails modification only on the network simplex algorithm's pricing rule. The algorithm is capable of lowering both the number of simplex pivots and the time per pivot.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Computational implementation of Fujishige's graph realizability algorithm
Article Abstract:
The computational implementation of the Fujishige's PQ-graph algorithm has demonstrated its almost linear time computational complexity. The implementation on randomly generated matrices with up to 500 rows and 9000 columns showed the existence of a fixed overhead despite an almost linear computation time growth. Such fixed overhead can be identified through the density and number of columns.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A tabu search approach for the flow-shop scheduling problem. Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
- Abstracts: Computers and wages. A dip in the valley. Gentle giants: technology can create near-monopolies, that is sometimes a good thing
- Abstracts: Models and methods for an integrated design of products and processes. Information management for concurrent engineering
- Abstracts: Hong Kong sets pension plan. Pension funds' golden years: Asia's graying population promises profit. Fund plan races to deadline
- Abstracts: Keeping faith in U.S. bonds: higher returns still tempt Japanese investors