Local search for Steiner tree problem in the Euclidean plane
Article Abstract:
A study has been conducted to compare neighborhoods and local search methods on the 15,100-terminal instances. The study made five independent runs on each instance for each neighborhood/local search method combination. Findings have indicated that the Steiner points approach had been the most popular and successful local search approach. Full Steiner tree based methods have been proven to effective when analyzing data on greedy heuristics.
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:
Computing improved optimal solutions to max-min flexible constraint satisfaction problems
Article Abstract:
A study was conducted to find improved optimal solutions to max-min flexible constraint satisfaction problems such as scheduling problems, traveling salesman problems, and special forms of fuzzy linear constraint problems. A multi-step constraint propagation procedure was proposed to solve these optimization problems with flexible constraints. The method has been shown to provide optimal solutions.
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: Examining the effect of second-order terms in mathematical programming approaches to the classification problem. part 2
- Abstracts: Demand estimation with failure and capacity constraints: an application to prisons. Efficient algorithms for the clearing of interbank payments
- Abstracts: CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty
- Abstracts: Using data envelopment analysis for costing bank products. Fast simulation of blocking probabilities in loss networks