1. Books and Surveys 2. Theory 2.1 Structural properties of the EVF 2.2 Complexity related results 3. General Purpose Algorithms 3.1 Benders’ decomposition methods 3.2 Gröbner basis methods 3.3 Convex approximations of SIR models 3.4 Other methods 4. Solution of Specific Problems 4.1 Production planning and scheduling problems 4.2 Network and routing problems 4.3 Location problems 4.4 Other pro...

Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bilayer networks, comparing with Knippel’s previous results.

Railway transport becomes a more popular transportation in many countries due to its large capacity, low energy consumption, and benign environment. The passenger train service planning is the key of rail operations system balance demand. In this paper, we propose mixed binary linear programming formulation for optimize route, frequency, stop schedule, assignment simultaneously. addition, analy...

This paper addresses a class of two-stage robust optimization models with integer adversarial variables. We discuss the importance of this class of problems in modeling two-stage robust resource planning problems where some tasks have uncertain arrival times and duration periods. We apply Dantzig-Wolfe decomposition to exploit the structure of these models and show that the original problem red...

Telecommunication networks frequently face technological advancements and need to upgrade their infrastructure. Adapting legacy the latest technology requires synchronized technicians responsible for migrating equipment. The goal of network migration problem is find an optimal plan this process. This a defining step in customer acquisition telecommunications service suppliers, its outcome direc...

Railway timetable planning is one of the key factors in successful operation a railway network. The must satisfy all operational restrictions at microscopic representation network, while maximizing transportation capacity for passengers and freight. an NP-Hard problem, difficult to solve large-scale networks, such as those entire countries. In this work, we propose logic Benders decomposition a...