The Benders decomposition algorithm has been successfully applied to a wide range of
difficult optimization problems. This paper presents a state-of-the-art survey of this algorithm …

This paper presents a tutorial on the state-of-the-art software for the solution of two-stage
(mixed-integer) linear stochastic programs and provides a list of software designed for this …

This paper presents exact algorithms based on logic-based Benders decomposition and a
variant, called branch-and-check, for the heterogeneous fixed fleet vehicle routing problem …

Tactical and operational decisions must nowadays be made in production and distribution
systems to allocate the best possible locations for the establishment of service centers …

This paper describes a Benders decomposition algorithm capable of efficiently solving large-
scale instances of the well-known multicommodity capacitated network design problem with …

Pre-runtime scheduling of large-scale electronic systems, as those in modern aircraft, can be
computationally challenging. In this paper, we study a distributed integrated modular avionic …

Difficult combinatorial optimization problems coming from practice are nowadays often
approached by hybrid metaheuristics that combine principles of classical metaheuristic …

Logic-based Benders decomposition (LBBD) is a substantial generalization of classical
Benders decomposition that, in principle, allows the subproblem to be any optimization …

This study introduces the logic‐based discrete‐Benders decomposition (LD‐BD) for
Generalized Disjunctive Programming (GDP) superstructure problems with ordered Boolean …

Despite the existence of a rich literature on Production Routing Problem (PRP), the lack of
investigations on the workforce planning, and its impact on costs and productivity of the …