Machine-translated by Google. Questions are authored in English.
Top

Discussion

Why are hybrid constraint and integer programming solvers used?

  • A.The combination guarantees a polynomial time solution
  • B.Global bounds and local propagation prune in different ways
  • C.Neither method alone can express the constraints of real problems
  • D.Hybrid solvers are simpler to implement than either alone

Answer: B

A linear relaxation bounds the objective globally while propagation reasons about combinatorial structures such as sequencing and all different, and each prunes cases the other misses. Both are expressive enough alone, hybrids are considerably more complex, and no polynomial guarantee follows. Combining two pruning mechanisms whose blind spots do not coincide is the same reasoning that makes taking the maximum of two admissible heuristics worthwhile.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.