On the longest reach problem in large deflection elastic rods
Sign Up to like & getrecommendations! Published in 2020 at "International Journal of Non-linear Mechanics"
DOI: 10.1016/j.ijnonlinmec.2019.103310
Abstract: Abstract The longest reach problem of an elastic cantilevered rod subjected to a tip load is here revisited. It has been investigated for the first time recently (Wang, 2016). In this paper, two extensions of… read more here.
Keywords: longest reach; problem large; large deflection; problem ... See more keywords
On solving the densest k-subgraph problem on large graphs
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2019.1595620
Abstract: ABSTRACT The densest k-subgraph problem is the problem of finding a k-vertex subgraph of a graph with the maximum number of edges. In order to solve large instances of the densest k-subgraph problem, we introduce… read more here.
Keywords: densest subgraph; problem; subgraph problem; problem large ... See more keywords
Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach
Sign Up to like & getrecommendations! Published in 2018 at "Interfaces"
DOI: 10.1287/inte.2018.0950
Abstract: The authors developed a model based on constraint programming to provide the best feasible solution(s) for minimizing the dispatching delays within a given planning horizon. read more here.
Keywords: large terminal; dispatching problem; station dispatching; constraint programming ... See more keywords