Results 171 to 180 of about 135,666 (285)

A Conversation With David Bellhouse

open access: yesInternational Statistical Review, EarlyView.
Summary David Richard Bellhouse was born in Winnipeg, Manitoba, on 19 July 1948. He studied actuarial mathematics and statistics at the University of Manitoba (BA, 1970; MA, 1972) and completed his PhD at the University of Waterloo, Ontario, in 1975. After being an Assistant Professor for 1 year at his alma mater, he joined the University of Western ...
Christian Genest
wiley   +1 more source

Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia   +2 more
wiley   +1 more source

A fast metaheuristic approach for the planar multiple obnoxious facility location problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar   +2 more
wiley   +1 more source

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati   +3 more
wiley   +1 more source

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos   +3 more
wiley   +1 more source

Expected Complexity of Barcode Reduction. [PDF]

open access: yesJ Appl Comput Topol
Giunti B, Houry G, Kerber M, Söls M.
europepmc   +1 more source

The Effects of Political Exclusion: Threatened Needs and Decreased Affiliation With Increased Anger and Antisocial Inclinations

open access: yesJournal of Applied Social Psychology, Volume 55, Issue 5, Page 305-321, May 2025.
ABSTRACT Social exclusion threatens psychological needs satisfaction, increases anger, and can contribute to group polarization. In two studies, we explored how political exclusion (vs. inclusion) influenced American voters' polarization. In Study 1 (N = 135, 60.7% Female, 61.5% White; Age M = 19.63), young adults were included or excluded in Cyberball
Katarina E. AuBuchon   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy