Results 101 to 110 of about 2,364,396 (151)

Clustering All‐Cause Mortality Data: A Review

International Statistical Review, EarlyView.
Summary Mortality data are relevant to demography, public health and actuarial science; such data are high‐dimensional, making broad patterns difficult to identify. Clustering is increasingly used to reveal such patterns, yet a review of its application to all‐cause mortality with a focus on country‐level data is lacking.
Pedro Menezes de Araújo, Isobel Claire Gormley, Thomas Brendan Murphy   +2 more
wiley   +1 more source

The Incentive Virtues of Performance‐Based Trade Allowances and Loss Leading

The Journal of Industrial Economics, EarlyView.
ABSTRACT A retailer can boost demand for a manufacturer's product through non‐verifiable activities. Performance‐based trade allowances—rebates conditional on the retailer's successful sales efforts—help mitigate this moral hazard problem. In equilibrium, the wholesale contract includes a retail price set below cost, complemented by a rebate for ...
David Martimort, Jérôme Pouyet
wiley   +1 more source

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods

, 2013
International audienceThis article presents a family of semidefinite programming bounds, obtained by Lagrangian duality, for 0-1 quadratic optimization problems with linear or quadratic constraints. These bounds have useful computational properties: they
Malick, Jérôme, Roupin, Frédéric, Frédéric Roupin, Jérôme Malick   +3 more
core   +1 more source

The Great Temporal Divide: How Top Management Team Temporal Faultlines and Dominant Subgroups Shape Firm Innovativeness in Iran

Journal of Management Studies, EarlyView.
Abstract While executives vary in attention to the past, present, and future, prior work has largely examined these temporal orientations in isolation or at the individual level, which limits insight into how they jointly configure within top management teams (TMTs) and translate into firm behaviours.
Shi Tang, Sherry M. B. Thatcher, Andreas W. Richter, Stephen X. Zhang, Asghar Afshar Jahanshahi   +4 more
wiley   +1 more source

A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits

IEEE Transactions on Quantum Engineering
Variational quantum optimization algorithms, such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA), are among the most studied quantum algorithms.
David Winderl, Nicola Franco, Jeanette Miriam Lorenz   +2 more
doaj   +1 more source

LARGE SCALE UNCONSTRAINED OPTIMIZATION

, 2009
This work is a survey on the methods for large scale unconstrained optimization. Besides its own theoretical importance, the growing interest in the last years in solving problems with a larger and larger number of variables are arising very frequently ...
ROMA, Massimo, Massimo Roma
core   +1 more source

Welfare implications of fair and accountable insurance pricing

Journal of Risk and Insurance, EarlyView.
Abstract This paper introduces an empirical framework to evaluate the welfare implications of fair and accountable insurance pricing by modeling the complete pricing process, including demand and price optimization. Moving beyond traditional cost modeling, we analyze both discrimination‐related fairness criteria and broader regulatory constraints, such
Fei Huang, Hajime Shimao
wiley   +1 more source

Dynamic capital allocation in general insurance

Journal of Risk and Insurance, EarlyView.
Abstract This paper provides a model for allocating capital to different insurance lines with varying development periods for a value‐maximizing insurance company. In our model, the company makes capitalization and exposure decisions considering its capital level and its relevant loss history.
Qiheng Guo, Daniel Bauer, George H. Zanjani   +2 more
wiley   +1 more source

A smaller and more efficient one-hot encoding for QUBO

Scientific Reports
One-hot constraints are widely used for quadratic unconstrained binary optimization (QUBO) in quantum and simulated annealing to solve optimization problems. They correspond to exactly-one constraints for Boolean satisfiability problems (SAT), which have
Shinji Takasugi, Hideo Nakaya, Yoshihiro Nakao, Kenta Sawamura   +3 more
doaj   +1 more source

Area-time complexity of the unconstrained minimization problem

, 1986
In this paper we intestigate the complexity of unconstrained optimization in VLSI models. We present a design providing an upper bound to the areax(time)?2 complexity of unconstrained minimization, in the case of quadratic functions, which falls short of
Codenotti B, Favati P
core   +1 more source