In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists in a heuristic implementation of the exact Benders-t...

For EL the least common subsumer (lcs) need not exist, if computed w.r.t. general TBoxes. In case the role-depth of the lcs concept description is bounded, an approximate solution can be obtained. In this paper we extend the completion-based method for computing such approximate solutions to ELI and EL+. For ELI the extension needs to be able to treat complex node labels. For EL+ a naive method...

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....

Abstract This paper considers whether scientists can improve their visual design abilities by participating in critiques. In education, a critique is class session where designers present work-in-progress and receive feedback from faculty, peers, invited critics. this study, we show that an intervention consisting of (1) introduction to principles, (2) explanation methodology, (3) participation...

The essential part of the best known approximation algorithm for graph MAXCUT is approximately solving MAXCUT’s semidefinite relaxation. For a graph with n nodes and m edges, previous work on solving its semidefinite relaxation for MAXCUT requires space Õ(n). Under the assumption of exact arithmetic, we show how an approximate solution can be found in space O(m + n), where O(m) comes from the i...

the passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. a line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. a new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....

The essential part of the best known approximation algorithm for graph MAXCUT is approximately solving MAXCUT's semideenite relaxation. For a graph with n nodes and m edges, previous work on solving its semidef-inite relaxation for MAXCUT requires space ~ O(n 2). Under the assumption of exact arithmetic, we show how an approximate solution can be found in space O(m+n 1:5), where O(m) comes from...

background: on an average 30-50% of patients who undergo incision and drainage (i and d) of anal abscess will develop recurrence or fistula formation. it is claimed that finding the internal orifice of anal abscess to distract the corresponding anal gland duct; will decline the rate of future anal fistula. surgeons supporting i and d alone claim that finding the internal opening is hazardous. t...