This study investigates the joint rolling stock rotation planning and depot deadhead
scheduling in complicated urban rail transit lines with multiple depots, multiple line services …

Integer (linear) programs are a standard way of formalizing a vast array of optimization
problems in industry, services, management, science, and technology. By the logic of the …

The purpose of this study is to address the allocation of transit lines problem in operation-
sharing. An allocation method for urban transit lines is proposed to guide public authorities …

The integral column generation algorithm (ICG) was recently introduced to solve set
partitioning problems involving a very large number of variables. This primal algorithm …

The integral simplex using decomposition (ISUD) algorithm was recently developed to solve
efficiently set partitioning problems containing a number of variables that can all be …

This paper considers a management zone delineation problem in a precision agriculture
framework that defines a partition of a field into rectangular and homogeneous management …

The problem of delineating site-specific management zones in agricultural fields arises in
the context of precision agriculture, where the control of variability in soil properties is …

Since its introduction in 1969, the set partitioning problem has received much attention, and
the structure of its feasible domain has been studied in detail. In particular, there exists a …

Large-neighbourhood search (LNS) heuristics are important mathematical programming
techniques that search for primal feasible solutions by solving an auxiliary problem with a …

Integer programs for resource-constrained project scheduling problems are notoriously hard
to solve due to their weak linear relaxations. Several papers have proposed reformulating …