Results 181 to 190 of about 2,808,560 (278)

Interdiction Models and Heuristics for Graph Propagation

open access: yesNetworks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

Exact Methods for the Cumulative Capacitated Vehicle Routing Problem With Time Windows

open access: yesNetworks, EarlyView.
ABSTRACT This article studies the cumulative capacitated vehicle routing problem with time windows (CCVRPTW). The CCVRPTW consists of deciding the routing schedules for a set of homogeneous capacitated vehicles such that the latency, that is, the sum of the service start times at the customers, is minimized and the time windows as well as the vehicle ...
Alan Osorio‐Mora, Timo Gschwind
wiley   +1 more source

A Two‐Stage Optimization Approach for Selecting Electric‐Flight Airports

open access: yesNetworks, EarlyView.
ABSTRACT The decarbonization of short‐haul air transport has gained increasing attention, with electric aircraft emerging as a promising alternative to conventional short‐haul aviation. However, given the substantial investment anticipated for the necessary infrastructure, a strategic and globally coordinated selection of airports is imperative.
Imke Joormann   +2 more
wiley   +1 more source

On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)

open access: yesNetworks, EarlyView.
ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs   +2 more
wiley   +1 more source

The Single Picker Routing Problem with Scattered Storage in Parallel‐Aisle Warehouses With Multiple Blocks

open access: yesNetworks, EarlyView.
ABSTRACT This paper investigates the b$$ b $$‐block single picker routing problem with scattered storage (b$$ b $$‐SPRP‐SS). For a parallel‐aisle warehouse comprising b$$ b $$ blocks, the b$$ b $$‐SPRP‐SS asks for the determination of a picker tour that minimizes travel distance while collecting all articles from a given pick list.
Stefan Irnich, Laura Lüke
wiley   +1 more source

Home - About - Disclaimer - Privacy