For answers, see "Suggested answers".
-
What is node evaluator and a search selector?
-
What is Slice-Based Search (SBS)?
-
Modify the program in this lesson to use the data file
YourSolverHome/examples/data/store_ex3.dat. This data file contains information for 30 stores and 15 warehouses. The ten additional potential warehouse sites are: Munich, Barcelona, Prague, Dublin, Madrid, Lisbon, Berlin, Amsterdam, Brussels, and Milan.
-
Modify the file
YourSolverHome/examples/src/graph.cpp to use Slice-Based Search (SBS) instead of the default Depth-First Search (DFS). Comment out the code using the IloBasicLevel filter level. Run the file on the clique set starting with size 61. As you remember, this is a particularly difficult instance of the problem to solve. Evaluate the solutions you get and compare them to the solution you found in Chapter 12, Setting Filter Levels: Coloring Graphs.
PREVIOUS
NEXT