Results 11 to 20 of about 1,984,613 (222)
Drones, 2023 This article presents a constraint modeling approach to global coverage-path planning for linear-infrastructure inspection using multiple autonomous UAVs.
Lea Matlekovic, Peter Schneider-Kamp
doaj +1 more source
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj +1 more source
EURO Journal on Computational Optimization, 2016 This paper addresses two variants of the routing and wavelength assignment problem arising in the context of optical transport networks. In both variants, we address the case where the physical coverage of the fiber network is such that regenerators, to ...
Amaro de Sousa +2 more
doaj +1 more source
Relational parametricity for higher kinds [PDF]
, 2012 Reynolds’ notion of relational parametricity has been extremely influential and well studied for polymorphic programming languages and type theories based on System F.
Atkey, Robert
core +1 more source
Wireless Networks: New Models and Results [PDF]
, 2007 Wireless communications have gained much currency in the last few decades. In this thesis we present results regarding several wireless communication systems, in particular, wireless networks.
Radhika Gowaikar, Gowaikar, Radhika
core +1 more source
A water storage and release strategy for flood management based on transportation network with time delay [PDF]
, 2013 Today, with frequency and severity of extreme weather, flood management became in the world a major concern for governments. The engendered problems are relative to goods and persons safety.
Archimède, Bernard +5 more
core +1 more source
On solving a non-convex quadratic programming problem involving resistance distances in graphs
, 2020 Quadratic programming problems involving distance matrix (D) that arises in trees are considered in the literature by Dankelmann (Discrete Math 312:12–20, 2012), Bapat and Neogy (Ann Oper Res 243:365–373, 2016). In this paper, we consider the question of
Neogy, S. K., Dubey, Dipti
core +1 more source
Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs [PDF]
, 2012 Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs). These approaches rely on iterative improvements to a starting solution, involving slight alterations to the routes
Harwood, Kieran +5 more
core +1 more source
Extended RDF: Computability and Complexity Issues [PDF]
, 2015 ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. Based
Analyti, Anastasia +3 more
core +1 more source
Transitive reduction of citation networks [PDF]
, 2014 In many complex networks, the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal structure.
Tamar V. Loach +7 more
core +1 more source