Discrete optimization: a simulated annealing approach for the circular cutting problem
Article Abstract:
The results of the study that was conducted to find solutions for unconstrained and constrained cutting problems using SA algorithm have been discussed. The procedures used in the study have been mentioned.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
Article Abstract:
The problem of weighted independent set problem in operations management is addressed by using simple approximation algorithm method.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Differential approximation results for the traveling salesman problem with distances 1 and 2
Article Abstract:
Appromixation algorithm is used for tackling the traveling salesman problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Simulated annealing for complex portfolio selection problems. Optimal portfolio selection and dynamic benchmark tracking
- Abstracts: A bicriteria approach to the two-machine flow shop scheduling problem. Assembly line balancing in a mixed-model sequencing environment with synchronous transfers
- Abstracts: Hybrid scatter search and path relinking for the capacitated p-median problem. Center problems with pos/neg weights on trees