Results 71 to 80 of about 22,651 (215)
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
Markov Determinantal Point Process for Dynamic Random Sets
ABSTRACT The Law of Determinantal Point Process (LDPP) is a flexible parametric family of distributions over random sets defined on a finite state space, or equivalently over multivariate binary variables. The aim of this paper is to introduce Markov processes of random sets within the LDPP framework. We show that, when the pairwise distribution of two
Christian Gouriéroux, Yang Lu
wiley +1 more source
Continuous black-box optimization with an Ising machine and random subspace coding
A black-box optimization algorithm such as Bayesian optimization finds the extremum of an unknown function by alternating the inference of the underlying function and optimization of an acquisition function.
Syun Izawa +4 more
doaj +1 more source
ABSTRACT Whereas organizational network studies infer employees’ agentic desires through observed network changes, we capture desires to collaborate more closely with co‐workers directly through a survey. We argue that formal structures create workflow dependencies between employees as they gather others’ inputs to complete their tasks, and individuals
Seong Won Yang +5 more
wiley +1 more source
Quantum Annealing in the NISQ Era: Railway Conflict Management
We are in the noisy intermediate-scale quantum (NISQ) devices’ era, in which quantum hardware has become available for application in real-world problems. However, demonstrations of the usefulness of such NISQ devices are still rare.
Krzysztof Domino +5 more
doaj +1 more source
A Polynomial-Time Algorithm for Unconstrained Binary Quadratic\n Optimization [PDF]
Juan Ignacio Mulero-Martínez
openalex +2 more sources
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model
The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens' quality of life.
Andrea Marchesin +4 more
doaj +1 more source
Stabilizing Inference in Dirichlet Regression via Ridge‐Penalized Model
ABSTRACT We propose a penalized Dirichlet regression framework for modeling compositional data, using a softmax link to ensure that the mean vector lies on the simplex and to avoid log‐ratio transformations or zero replacement. The model is formulated in a GLM‐like setting and incorporates an ℓ2$$ {\mathrm{\ell}}_2 $$ (ridge) penalty on the regression ...
Andrea Nigri
wiley +1 more source
Join order optimization is among the most crucial query optimization problems, and its central position is also evident in the new research field where quantum computing is applied to database optimization and data management.
Valter Uotila
doaj +1 more source

