Variable neighborhood search for the vertex weighted k-cardinality tree problem
Article Abstract:
New heuristic approach for variable neighborhood search for solving vertex weighted k-cardinality tree problem in operations research is presented.
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:
Path relinking and GRG for artificial neural networks
Article Abstract:
The usage of artificial neural networks in path re-linking for Generalized Reduced Gradient process in operations research is discussed.
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:
- Abstracts: The danger of innovation, icons, and taking our i's off the road. If experience stifles thought, let us pursue the unexpected
- Abstracts: From branches to call centers: new strategic realities in retail banking. Strategic and marketing implications of consumer behaviour in financial services
- Abstracts: Get connected. National identity
- Abstracts: The high cost of democracy. Cashing in on the Korean dream
- Abstracts: Master the art of mediation to successfully resolve disputes. Participation is key in solving the problems of mediation