Results 101 to 110 of about 406 (199)
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
Orienteering with One Endomorphism. [PDF]
Arpin S +5 more
europepmc +1 more source
ABSTRACT Accurate, time‐resolved installed capacity data are crucial for forecasting and analysing wind‐power production. The time series of installed capacity is often only approximately known in regions with rapid wind power development. Public wind power databases may only be updated yearly and installation dates may not be differentiated within ...
Olle Viotti, Johan Arnqvist, Jon Olauson
wiley +1 more source
Primal categories of neural polarity codes. [PDF]
Baram Y.
europepmc +1 more source
Effective primality tests for some integers of the forms 𝐴5ⁿ-1 and 𝐴7ⁿ-1
It is shown how polynomial time prime tests, which are both fast and deterministic, can be developed for many numbers of the form A r n − 1 ( r =
H. C. Williams
core +1 more source
Helping families thrive while developing a strong working alliance: The benefits of Recipe 4 Success
Abstract This study explored whether the strength of parent‐home visitor working alliances might alter the benefits of Recipe 4 Success, a highly structured food‐based curriculum designed to promote parents’ sensitive scaffolding, responsive food parenting practices, toddlers’ self‐regulation, and healthy eating habits.
Sarah M. Braaten +6 more
wiley +1 more source
Primality Testing with Artin Symbols
It is a recent discovery that many primality testing algorithms are based on the following trivial theorem.
openaire +3 more sources
Implementation of Goldwasser-Kilian primality test on elliptic curves [PDF]
Due to the development in information security and cryptography fields, in particular public-key cryptography, the importance of searching for large prime numbers has increased. Solovay and Strassen, in 1977, and Miller and Rabin, in 1980, were developed
Gimadiev Marat
core
Ordered Median Traveling Salesman Problem
ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source
ABSTRACT Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high ...
Marco Mangano +5 more
wiley +1 more source

