A Cutting-Plane Algorithm for Multicommodity Capacitated Fixed-Charge Network Design

This paper examines the problems of maximum and minimum cost flow determining in networks in terms of uncertainty, in particular, the arc capacities, as well as the

A new version of the analytic center cutting plane method (ACCPM) is used to solve the Lagrangian dual problem.. In the present dissertation, we propose important features

As for MIP approaches, we observe first that ADMAN can be interpreted as a classical single machine scheduling problem with sequence dependent setup times and

In this paper, we compare two cutting-plane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual

In this paper we consider the Two- Echelon Capacitated Vehicle Routing Problem (2E-CVRP), the two-echelon variant of the well known Capacitated Vehicle Routing Problem, where

The lower bounds obtained by their algorithm are very tight and suggest that by improving the separation algortithms as well as developing new families of valid inequalities,

In this section, we present three relaxations of the M CN D, the single-arc design, single- cutset, and single-cutset flow problems, from which we derive the five classes of

For these two classes, the strong relaxation bound and CPLEX lower bound are almost equal, with an average gap of 0.2%; the CPU times, however, are significantly different: while