Add to ORKGInternational audienceThis paper introduces a new optimisation criterion to separate constraints so as to reduce the number of iterations for a network design dedicated Benders-like constraint generation procedure. With this criterion we try to minimize the number of iterations by maximizing the value difference of the objective function between the iterations. The criterion is used to generate efficient bipartition cuts and accelerate a network design method by Gabrel, Knippel and Minoux
The authors consider the problem of decreasing the edge weights of a given network so that the modif...
International audienceWe describe an exact solution procedure, based on the use of standard LP softw...
This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The ...
Benders decomposition has been widely used for solving network design problems. In this paper, we us...
We consider two covering variants of the network design problem. We are given a set of origin/destin...
In this paper, a general scheme for generating extra cuts during the execution of a Benders decompos...
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Comp...
This paper presents two exact algorithms based on Benders decomposition for solving the multicommodi...
Various types of communication networks are constantly emerging to improve connectivity services and...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
AbstractNetwork design applications are prevalent in transportation and logistics. We consider the m...
Not AvailableThis research was supported by the U.S. Department of Transportation under Contract DOT...
This paper discusses problems in the context of multicommodity network design where the additional c...
The aim of Network Design Problem with Vulnerability Constraints (NDPVC), is to design survivable te...
The authors consider the problem of decreasing the edge weights of a given network so that the modif...
International audienceWe describe an exact solution procedure, based on the use of standard LP softw...
This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The ...
Benders decomposition has been widely used for solving network design problems. In this paper, we us...
We consider two covering variants of the network design problem. We are given a set of origin/destin...
In this paper, a general scheme for generating extra cuts during the execution of a Benders decompos...
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Comp...
This paper presents two exact algorithms based on Benders decomposition for solving the multicommodi...
Various types of communication networks are constantly emerging to improve connectivity services and...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
Given a set of candidate road projects associated with costs, finding the best subset with respect t...
AbstractNetwork design applications are prevalent in transportation and logistics. We consider the m...
Not AvailableThis research was supported by the U.S. Department of Transportation under Contract DOT...
This paper discusses problems in the context of multicommodity network design where the additional c...
The aim of Network Design Problem with Vulnerability Constraints (NDPVC), is to design survivable te...
The authors consider the problem of decreasing the edge weights of a given network so that the modif...
International audienceWe describe an exact solution procedure, based on the use of standard LP softw...
This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The ...