To efficiently derive bounds for large-scale instances of the capacitated fixed-charge
network design problem, Lagrangian relaxations appear promising. This paper presents the …

Network design models have wide applications in telecommunications and transportation
planning; see, for example, the survey articles by Magnanti and Wong (1984), Minoux …

We consider a network interdiction problem on a multicommodity flow network, in which an
attacker disables a set of network arcs in order to minimize the maximum profit that can be …

In this paper, we examine the potential interactions of corporate financing and investment
decisions in the presence of incentive problems. We develop a system‐based approach to …

We study a class of generalized bundle methods for which the stabilizing term can be any
closed convex function satisfying certain properties. This setting covers several algorithms …

The paper presents a simple and effective Lagrangian relaxation approach for the solution
of the optimal short-term unit commitment problem in hydrothermal power-generation …

Over the last decades, network design problems (NDPs) have been one of the most
investigated combinatorial optimisation problems that are still catching the interest of both …

Planning a public transportation system is a complex process, which is usually broken down
in several phases, performed in sequence. Most often, the trips required to cover a service …

Motivated by an industrial application, we consider a recently introduced multi-period facility
location problem with multiple commodities and multiple capacity levels. The problem allows …

It is well-known that the Lagrangian dual of an Integer Linear Program (ILP) provides the
same bound as a continuous relaxation involving the convex hull of all the optimal solutions …