The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …

The p‐median problem is a network problem that was originally designed for, and has been
extensively applied to, facility location. In this bibliography, we summarize the literature on …

Given n items and m knapsacks, the Generalized Assignment Problem (GAP) is to find the
optimum assignment of each item to exactly one knapsack, without exceeding the capacity …

Operation of on-demand services like taxis, dynamic ridesharing services, or vehicle sharing
depends significantly on the positioning of idle vehicles to anticipate future demand and …

In many mixed integer programs there is some embedded problem structure which can be
exploited, often by a decomposition. When the relaxation in each node of a branch …

Column generation is an indispensable tool in computational optimization to solve a
mathematical program by iteratively adding the variables of the model. Even though the …

The establishment of recycling network is critical to improve municipal solid waste (MSW)
management. However, how to determine the best locations for the recycling stations and …

We report on experiments with turning the branch-price-and-cut framework SCIP into a
generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our code …

With the development of petroleum industry and the exploitation of unconventional gas
reservoir, the topological form of surface pipeline network is changing gradually and a tree …

In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source
Capacitated Facility Location Problem (SSCFLP). At each level of CS's branching tree, it has …