Results 41 to 50 of about 36,372,437 (161)
ABSTRACT This study introduces the Paradox of Escapism, exploring how the act of escaping reality can evolve from a short‐term avoidance strategy to a mechanism for self‐regulation and enhanced life satisfaction. Employing five rigorous, multimethod investigations, including qualitative interviews and sentiment analysis (Study 1), Structural Equation ...
Thamiris Magalhães de Sousa +3 more
wiley +1 more source
The 0–1 knapsack problem (0-1KP) is a well-known discrete combinatorial optimization problem with various applications across multiple fields. Compared with traditional methods, metaheuristic algorithms show higher efficiency and flexibility in solving ...
Fengbin Wu +5 more
doaj +1 more source
List-Based Threshold Accepting Algorithm with Improved Neighbor Operator for 0–1 Knapsack Problem
The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm.
Liangcheng Wu +3 more
doaj +1 more source
ABSTRACT Integrating eco‐design practices in product development from the start is essential for fashion accessories like bags and backpacks, which involve complex manufacturing, diverse materials, and strong socio‐cultural meanings. Building on this premise and drawing from the Lifecycle Design Strategy Wheel, this study aims to characterize the eco ...
Francesco Paolo Lagrasta +2 more
wiley +1 more source
Factors influencing wintering turfgrass field use in Atlantic brant
Atlantic brant Branta bernicla hrota increasingly use turfgrass fields, such as baseball fields and golf courses, throughout their wintering range. Most studies have focused on their primary food source, submerged aquatic vegetation, while studies of other goose species worldwide have examined field use in different contexts, including agricultural ...
David J. Weber +3 more
wiley +1 more source
Branch and Bound for the 0/1 Knapsack Problem using Lagrangian Relaxation
A Java implementation of the branch and bound algorithm for the 0/1 knapsack problem. The code uses Lagrangian relaxation to prune the search tree. It uses best first search. The Lagrangian multipliers are computed using coordinate ascent in an iterative
Shalin Shah
core +2 more sources
90 Day Fiancé: Presentations of Status Exchange on the International Marriage Market
ABSTRACT Objective This study examines power and status, as constructed by producers on the reality television show 90 Day Fiancé, that comes from being a US citizen on the international marriage market. We investigate what show producers present each partner as offering the other and what this suggests about gender and power in cross‐national ...
Andrea Laurent‐Simpson +2 more
wiley +1 more source
In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search algorithm, and a hybrid genetic algorithm-simulated ...
Absalom E. Ezugwu +4 more
doaj +1 more source
The growing need for profit maximization and cost minimization has made the optimization field very attractive to both researchers and practitioners.
Laabadi Soukaina +3 more
doaj +1 more source
Enhancing Recharge Beneath Low‐Permeability Landscapes with Small‐Diameter Drywells: Token Creek, WI
Shallow, small‐diameter drywells provide enhanced recharge in rural landscapes, bypassing the low infiltration rates caused by low permeability surficial soils and high ET rates. One year of monitoring data show several recharge events and overall high water quality.
Samantha C. Kershner +2 more
wiley +1 more source

