
New approaches for the uncapacitated threelevel lotsizing and replenishment problem with a distribution structure
We consider the uncapacitated threelevel lotsizing and replenishment p...
read it

MIP and Set Covering approaches for Sparse Approximation
The Sparse Approximation problem asks to find a solution x such that y...
read it

Nested Column Generation decomposition for solving the Routing and Spectrum Allocation problem in Elastic Optical Networks
With the continued growth of Internet traffic, and the scarcity of the o...
read it

Branchandcut algorithms for the covering salesman problem
The Covering Salesman Problem (CSP) is a generalization of the Traveling...
read it

Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era
In the past few decades, optical transport networks (OTNs) have undergon...
read it

Extended formulation and valid inequalities for the multiitem inventory lotsizing problem with supplier selection
This paper considers the multiitem inventory lotsizing problem with su...
read it

Benchmark Instances and BranchandCut Algorithm for the Hashiwokakero Puzzle
Hashiwokakero, or simply Hashi, is a Japanese singleplayer puzzle playe...
read it
Valid inequalities and a branchandcut algorithm for the routing and spectrum allocation problem
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ITUT standard G.694.1. In this specification, the frequency spectrum of an optical fiber link is divided into narrow frequency slots. Any sequence of consecutive slots can be used as a simple channel, and such a channel can be switched in the network nodes to create a lightpath. In this kind of networks, the problem of establishing lightpaths for a set of endtoend demands that compete for spectrum resources is called the routing and spectrum allocation problem (RSA). Due to its relevance, RSA has been intensively studied in the last years. It has been shown to be NPhard and different solution approaches have been proposed for this problem. In this paper we present several families of valid inequalities, valid equations, and optimality cuts for a natural integer programming formulation of RSA and, based on these results, we develop a branchandcut algorithm for this problem. Our computational experiments suggest that such an approach is effective at tackling this problem.
READ FULL TEXT
Comments
There are no comments yet.