Results 161 to 170 of about 286,084 (291)

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

open access: yesInternational Transactions in Operational Research, EarlyView.
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

A genetic algorithm simheuristic for solving the stochastic project portfolio selection problem with portfolio reliability constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz   +3 more
wiley   +1 more source

Multi‐objective maritime vessel routing with safety considerations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The routing of maritime vessels is a challenging optimization problem that involves finding an adequate balance between conflicting and multiple objectives. This paper proposes a methodology based on inverse optimization to find appropriate objective weights that account for conflicting objectives. To formulate the inverse optimization problem,
Nazanin Sharif   +4 more
wiley   +1 more source

Recognizing Properties of Decision Rule Systems Using Deterministic and Nondeterministic Decision Trees

open access: yesJournal of Intelligent Learning Systems and Applications
Kerven Durdymyradov, Mikhail Moshkov
openaire   +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

Towards a mathematical framework for modelling cell fate dynamics. [PDF]

open access: yesJ Math Biol
Vittadello ST   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy