algorithm specific command arguments

Algorithm specific command arguments

greedy:

• -sort [sort mode], where [sort mode] can be:
  • value-weight - (default)
  • value
  • weight
  • random
  • dont-sort

brute-force:

• -recursive
• -iterative - (default)
• -early - checks item fit before DFS call
• -late - check item fit in DFS call - (default)
• -order - forces specific order of looking through the possible solutions, can be one of the following:
  • zero-first
  • one-first
  • unconstrained - (default)
  • gray-code
  • random

branch-and-bound:

• -early - checks item fit before DFS call
• -late - check item fit in DFS call - (default)
• -bf - bounding function
  • dynamic
  • continous
  • none - (default)

greedy-heuristic-search:

• -to-visit [amount] - the amount of moves to discover in each DFS call, has to be in range from 1 to instance size. (2 by default), takes priority over -coverage.
• -coverage [coverage] - the percentage of valid moves to discover in each DFS call, has to be a in range (0.0, 1.0], if set to 0.0 or below, solver will output empty answer. If set above 1.0 solver will treat it as if it was set to 1.0.
• -fast - use fast implementation (accurate by default)
• -sort [sort mode], where [sort mode] can be:
  • value-weight - (default)
  • value
  • weight
  • random
  • dont-sort

grasp:

• -iterations [iterations] - the amount of grasp findings to choose the best from
• chose-from [chose from] - value from 0 to 1 percentage of first best elements to try to add
• -sort [sort mode], where [sort mode] can be:
  • value-weight - (default)
  • value
  • weight
  • random
  • dont-sort

dynamic:

takes no arguments