Variable neighborhood tabu search and its application to the median cycle problem

Article Abstract:

The variable neighborhood tabu search (VNTS) is a very general tool that can be used to look for good solutions to optimization problems. The details of implementation for the median cycle procedure and the corresponding computational experience are reported.

Methods, Search theory, Median (Statistics)

---

Global constraints for round robin tournament scheduling

Article Abstract:

Round robin tournament problems are hard combinatorial problems, commonly tackled with branch-and-bound optimization and with tree search. Constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain.

Usage, Scheduling (Management), Graph theory

---

Relaxation of the Condorcet and Simpson conditions in voting location

Article Abstract:

Condorcet location conditions are modified and their efficacy is evaluated.

Europe, Science & research, Research, Evaluation, Condorcet paradox

Similar abstracts:

• Abstracts: The marginal cost analysis and its application to repair and replacement policies. Special cases of the quadratic assignment problem
• Abstracts: Savoy Theatre: restored and built on. A burning problem
• Abstracts: Foundations and applications of a knowledge management scan. Knowledge sharing in an emerging network of practice: the role of a knowledge portal
• Abstracts: The extended merger and acquisition process: understanding the role of IPOs in corporate strategy. Integrating the strategy formation process: an international perspective
• Abstracts: Solving the resource-constrained project scheduling problem by a variable neighborhood search. Upper and lower bounds for the single source capacitated location problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.