In three output files we report detailed numerical results of the numerical experiments conducted for the paper:

B. Jargalsaikhan, W. Romeijnders, and K.J. Roodbergen (2019). A compact arc-based ILP formulation for the pickup and delivery problem with divisible pickups and deliveries.

Each output file corresponds to the numerical experiments related to one of the tables  (Tables 1-3) of the paper. Below we explain the column names in the output files:

Name: 		The name of the instance
Obj:		Optimal objective value, or objective value of best solution found 
		(NA if problem is infeasible or unknown to be feasible)
Status: 	Optimal, Feasible, Infeasible, or Unknown 
Time:		Computation time in seconds

Cuts:		Number of lazy cuts added by Cplex before the time limit was reached
Split:		1 if some node is visited more than once; 0, otherwise