A directed cycle‐based column‐and‐cut generation method for capacitated survivable network design

Rajan, Deepta; Atamtürk, Alper

doi:10.1002/net.20004

Cited by 25 publications

(29 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, considerable research attention has also been directed toward the design of survivable networks (see Rajan and Atamtürk [29] and Balakrishnan et al [6]). Rajan and Atamtürk [29] show that an extension of 2-partition inequalities are facet-defining for their problem.…”

Section: Literature Reviewmentioning

confidence: 99%

k-Partition-based facets of the network design problem

Agarwal

2006

Networks

View full text Add to dashboard Cite

This article addresses the problem of designing a multicommodity network using facilities of a fixed capacity to satisfy a given set of traffic demands. This problem (called the NDP) arises primarily in the design of highcapacity telecommunication networks. The k -partition of the NDP graph is introduced which results in a smaller k -node NDP. The main result of the article is a theorem, which shows that a facet inequality of the k -node problem translates into a facet of the original problem under a fairly mild condition, that is, the subgraph of each component of the k -partition be connected. This theorem is utilized to show that 2-and 3-partition-based inequalities identified by previous researchers yield families of facets for the original NDP. The structure of the 4-node NDP is explored to derive three different classes of valid inequalities and the conditions under which they are facet defining. The effectiveness of these inequalities is indicated by the computational experience on a 10-node example.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

k-Partition-based facets of the network design problem

Agarwal

2006

Networks

View full text Add to dashboard Cite

show abstract

“…[11], or Evolutionary Algorithms, cf. [8], only are either restricted to a single linear objective function or do not perform well on optimization problems with many constraints and few feasible solutions.…”

Section: Optimizationmentioning

confidence: 99%

“…Related Work: Resource allocation and process binding strategies are studied in [1,11], mostly based on either exact approaches like Integer Linear Programs (ILPs) or using meta-heuristics like Evolutionary Algorithms (EAs). Process and message scheduling as well as the parameter estimation has been thoroughly studied in approaches like [4].…”

Section: Introductionmentioning

confidence: 99%

Designing heterogeneous ECU networks via compact architecture encoding and hybrid timing analysis

Glaß

Lukasiewycz

Teich

et al. 2009

Proceedings of the 46th Annual Design Automation Conference

View full text Add to dashboard Cite

In this paper, a design method for automotive architectures is proposed. The two main technical contributions are (i) a novel hardware/software architecture encoding that unifies a number of design steps, i.e., resource allocation, process binding, message routing, scheduling, and parameter estimation for the processor and bus schedulers, and (ii) a hybrid scheme that allows different timing analysis techniques to be applied to different bus protocols (viz., CAN and FlexRay) within the same architecture in order to derive global performance estimates such as end-to-end delays of messages. The use of the compact encoding technique substantially reduces the underlying search space, and the hybrid timing analysis scheme allows the combination of known timing analysis techniques from the real-time systems domain. The proposed techniques were combined into a tool-chain and a real-life case study to illustrate their advantages.

show abstract

“…• Ring protection and p-cycle protection, all the links are part of an overlaid structure, a ring or a p-cycle: Ring protection [4,9,10] and p-cycle protection [4,7,10] The above classification is quite broad and many variations exists for each protection method.…”

Section: Previous Workmentioning

confidence: 99%