I'd appreciate it if you'd answer my questions regarding branching priorities, the partition heuristic, their interactions and the operating principle of DistributedMIPJobs. I have tried to find answers in the documentation, but I have not found this specific information.
Regarding branching priorities in general:
# Are variables allowed to be assigned the same branching priorities, so that, for example, a group of variables has the same branching priority 1, and other groups of variables have the same branching priorities 2, 3, 4, ...?
## So how does Gurobi decide the order in which variables with the same branching priority are to be branched?
# Does it make a difference if I assign branching priorities with consecutive numbers (e.g.: 1, 2, 3, 4, ...) or with different weights (e.g.: 1, 2, 5, 10, 100, 1000, ...)?
Regarding the interaction of branching priorities and the partition heuristic:
# How are branching priorities and partition heuristic interacting? When I give Gurobi information on both, are the branching priorities evaluated only subordinately within each partition or do the branching priorities "overwrite" the partition heuristic? Can I use the parameter PartitionPlace to influence the behaviour?
Regarding the DistributedMIPJobs:
# If I enable the DistributedMIPJobs parameter, can I influence how MIPJobs are distributed to the workers?
# Can the partition heuristic be combined with the DistributedMIPJobs parameter and would the partitions then be distributed to the workers? What happens if I have more partitions than workers (or vice versa)?
Thank you very much for your assistance
Please sign in to leave a comment.