A MatNet variants

A.1 Multiple data matrices A combinatorial optimization problem can be presented with multiple (f) relationship features between two groups of items. In FFSP, for example, a production cost could be different for each process that one has to take into account for scheduling in addition to the processing time for each pair of the job and the machine. "Trainable element-wise function" block in Figure A.1 is now an MLP with f + 1 input nodes and 1 output node. A.2 Alternative encoding sequences Equation (2) in the main text describes the application of F The bold line indicates the change from the original. A.3 Alternatives to one-hot initial node embeddings For initial node representations of nodes in group B, one only needs mutually distinct-enough N We have chosen to present our model with onehot vectors because it is the simplest to implement this way.