Extent of sub-optimality and solve time for the three methods Troika, Combo, and Gurobi IP on the BA instances. by Samin Aref (22226678)

MATLAB files for an Integer Programming Approach to Overlapping Community Detection by michael brusco (3229473)

“…In the second stage, an integer programming model is formulated and solved to assemble maximal cliques into communities. …”

S1 File - A mixed-integer linear programming method for time-dependent line planning in passenger railway systems by Xin Shi (139139)

Subjects:

Two comparative performance measures for the three methods Troika, Combo, and Gurobi IP on the ABR benchmark dataset: (a) Extent of sub-optimality, (b) solve time. by Samin Aref (22226678)

Two comparative performance measures for the three methods Troika, Combo, and Gurobi IP on the clusedit benchmark dataset: (a) Extent of sub-optimality, (b) solve time. by Samin Aref (22226678)

Two comparative performance measures for the three methods Troika, Combo, and Gurobi IP on the correlation benchmark dataset: (a) Extent of sub-optimality, (b) solve time. by Samin Aref (22226678)

Two comparative performance measures for the three methods Troika, Combo, and Gurobi IP on the equicut benchmark dataset: (a) Extent of sub-optimality, (b) solve time. by Samin Aref (22226678)

Instances and detailed results of the paper <i>Stochastic scheduling on a restricted batching machine</i> by Yasmin Rios Solis (3909469)

“…We have developed mixed integer programming formulations and solved the stochastic problem using both a Benders decomposition approach and a biased random-key genetic algorithm. …”

MTVRP.ipynb by Brayan Steven Perdomo Cardenas (20553410)

“…This reduces the problem’s dimensionality to routing with multiple trips and a homogeneous fleet. The second phase solves this using mixed-integer linear programming. …”

Solution of a practical vehicle routing problem for monitoring water distribution networks by Reza Atefi (17700631)

“…The key must then be returned to the same key centre after the test has been performed, thus introducing precedence constraints and multiple visits in the routes. To solve the problem, a Mixed Integer Linear Programming model and an Iterated Local Search have been implemented. …”

Variation of the business times of each station. by Xin Shi (139139)

Subjects:

Distribution of Ave LF for all operated trains. by Xin Shi (139139)

Subjects:

Variation curves of the CPU time with gap for the 17^th case. by Xin Shi (139139)

Subjects:

Computational results of the MILP model. by Xin Shi (139139)

Subjects:

Variation curve of the relevant factors of the input and output data. by Xin Shi (139139)

Subjects:

Distribution of average waiting time and average load factor. by Xin Shi (139139)

Subjects:

Extension of a getting-off arc considering time dimension. by Xin Shi (139139)

Subjects:

The correlation between the Ave time and Ave LF of each train. by Xin Shi (139139)

Subjects:

Computational results of different passenger service capacities. by Xin Shi (139139)

Subjects:

Variation curves of the value of the objective function with different passenger service capacities. by Xin Shi (139139)

Subjects: