文件名称:Raid
介绍说明--下载内容来自于网络,使用问题请自行百度
刘备要准备一场对黄巾军的战斗, 为此他必须选择一批勇士参与这场战斗。战斗部队需要有l
到u 名勇士。每一个勇士都是某个宗族的成员,而且有的宗族之间的人相互敌视。在战斗部队中,
不能有多于m 对勇士的宗族是互相敌视的。战斗部队的战斗力是由部队中全体勇士的战斗力之和
决定的,而问题的目标是要使战斗部队的战斗力最大化(Liu Bei was ready for a battle of the Yellow turban army, so he must choose a group of warriors in the battle. Combat troops need to have l
To the U warrior. Every warrior is a member of a clan, and some of the clans are hostile to each other. In the fighting forces,
No more than M's clans of the warriors are hostile to each other. The fighting force of the fighting forces is the fighting power of all the warriors in the army.
It is decided that the goal of the problem is to maximize the combat effectiveness of the fighting forces.)
到u 名勇士。每一个勇士都是某个宗族的成员,而且有的宗族之间的人相互敌视。在战斗部队中,
不能有多于m 对勇士的宗族是互相敌视的。战斗部队的战斗力是由部队中全体勇士的战斗力之和
决定的,而问题的目标是要使战斗部队的战斗力最大化(Liu Bei was ready for a battle of the Yellow turban army, so he must choose a group of warriors in the battle. Combat troops need to have l
To the U warrior. Every warrior is a member of a clan, and some of the clans are hostile to each other. In the fighting forces,
No more than M's clans of the warriors are hostile to each other. The fighting force of the fighting forces is the fighting power of all the warriors in the army.
It is decided that the goal of the problem is to maximize the combat effectiveness of the fighting forces.)
相关搜索: minizinc
(系统自动生成,下载前可以参看下载内容)
下载文件列表
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.