Results 131 to 140 of about 12,280 (289)
Queues with infinitely many servers [PDF]
openaire +2 more sources
Abstract Graph drawing aesthetics have traditionally been optimized for human readers, leading to well‐established principles such as reducing edge crossings, enhancing symmetry, and minimizing bends. These criteria shape layout algorithms and define what “readability” means in network visualization.
Sara Di Bartolomeo +5 more
wiley +1 more source
Abstract Network visualization has traditionally relied on heuristic metrics, such as stress, under the assumption that optimizing them leads to aesthetic and informative layouts. However, no single metric consistently produces the most effective results.
X. Li, P. Zhang, X. Wang, H. Shen, Y. Hu
wiley +1 more source
Abstract The aim of this paper is to analyze the sociodemographic compositions and labor market entry of low‐educated youth in Japan. The paper specifically focuses on whether vocational education provides a safety net for labor market insecurities during an era of educational expansion.
Katsunori Ogawa
wiley +1 more source
Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri +3 more
wiley +1 more source
Vessel arrival planning with full information
Abstract Planning efficiency and timely arrival of vessels is crucial to smooth operations of maritime transport networks, ensuring optimal utilization of resources and minimizing operational costs. Coordination between vessel operators and terminals has the potential to reduce costs, fuel consumption, and waiting time.
Pim Willem Antoon van Leeuwen +1 more
wiley +1 more source
A Single-server retrial queue system with multidimentional Poisson flow
A single-server bufferless queue system with independent Poisson input flows and arbitrary service distribution functions is investigated. A customer of any type denied service joins the queue afresh, retaining his type.
P. P. BOCHAROV +3 more
core
Evaluation of drone system for thinning operations–a case study in Sweden
Abstract Thinning operations in forestry typically involve a two‐machine system (TMS) with a harvester and a forwarder. Its productivity in different forest conditions is well documented. To date, drones have been used for data collection and surveillance but not as an alternative to a TMS.
Mikael Rönnqvist +3 more
wiley +1 more source
A deep cut ellipsoid algorithm for convex programming
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its ...
Zhang, S. +2 more
core
Lost in the Noise: How IPO Suspensions Distract Venture Capitalists From Monitoring Portfolio Firms
ABSTRACT We examine how regulatory suspensions of initial public offerings (IPOs) affect venture capitalists’ (VCs’) post‐IPO monitoring of portfolio firms in China. Using a difference‐in‐differences design that exploits three major IPO suspension episodes as quasi‐natural experiments, we provide causal evidence that these shocks divert VCs’ attention ...
Ao Li +3 more
wiley +1 more source

