Výsledky vyhľadávania - "Boolean programming"

THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM Autor Simanchev, Ruslan Yu, Urazova, Inna V., Voroshilov, Vladimir V.

“…The paper deals with a digraph with non-negative vertex weights. A subset  \(W\) of the set of vertices is called dominating if any vertex that not belongs to…”
Získať plný text

Estimation of parameters for a cluster-based piecewise linear risk regression function Autor S.I. Noskov, S.V. Belyaev, A.R. Chekalova

“…Background. The article notes that cluster regression models are highly effective in studying various aspects of the analyzed objects’ functioning, including…”
Získať plný text

Accounting for a given error level in estimation of parameters of a piecewise-linear regression model Autor S.I. Noskov, S.V. Belyaev, Yu.A. Bychkov

“…Background. The development of mathematical models of complex objects is usually accompanied by an analysis of their admissibility using both strict formal…”
Získať plný text

Computing Parameter Estimates of a Homogeneous Nested Piecewise Linear Regression Autor Noskov, S. I., Belinskaya, S. I.

“…Objective . The aim of the study is to develop an algorithm for identifying the parameters of a homogeneous nested piecewise linear regression model of the…”
Získať plný text

University proceedings. Volga region. Technical sciences Autor S.I. Noskov, E.S. Popov

“…Background. An approach is proposed to increase the flexibility of nested piecewise linear regression models proposed earlier by one of the authors due to the…”
Získať plný text

Models, systems, networks in economics, engineering, nature and society Autor S.I. Noskov, E.S. Popov

“…Background. The construction of regression models of various complex objects in accordance with the objectives of the study is sometimes accompanied by the…”
Získať plný text

Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems Autor Sergienko, Ivan, Shylo, Vladimir, Roshchyn, Valentyna, Shylo, Petro

“…Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse…”
Získať plný text

Multi-objective probabilistically constrained programs with variable risk: Models for multi-portfolio financial optimization Autor Lejeune, Miguel A., Shen, Siqian

“…•Boolean reformulation method for multi-objective joint chance-constrained problems (MOPCP).•Multi-portfolio optimization models with centralized and…”
Získať plný text

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints Autor Halman, Nir, Kellerer, Hans, Strusevich, Vitaly A.

“…•A model suitable for handling take-or-leave decisions is introduced.•The objective is a non-linear non-separable function.•The constraints are nested linear…”
Získať plný text

The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases Autor Punnen, Abraham P., Sripratak, Piyashat, Karapetyan, Daniel

“…We consider the bipartite unconstrained 0–1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0–1 quadratic…”
Získať plný text

Probabilistic modeling of multiperiod service levels Autor Lejeune, Miguel A.

“…•Multiperiod service level (MSL) policies for supply chains.•Construction of replenishment plans that satisfy strict stockout-oriented performance…”
Získať plný text

On the Number of Solutions to a System of Boolean Equations Autor Leontiev, V. K., Gordeev, E. N.

“…We consider questions concerning the solvability and the number of solutions of systems of Boolean equations. Many mathematical models arising in both…”
Získať plný text

Development of a system of transport-interchange hubs in urban transport network Autor Moskvichev, Oleg V., Leonova, Svetlana A.

“…The paper considers the issues of the formation of a system of transport interchange hubs (TIH), associated with the determination of the location of TIH in…”
Získať plný text

A Boolean programming problem of choosing an optimal portfolio of projects and optimal schedules for them by reinvesting within the portfolio the profit from project implementation Autor Belenky, A.S.

“…A problem of choosing an optimal portfolio of projects from a set of m projects that are to be financed under a limited budget, along with a schedule for their…”
Získať plný text

A Novel Method for Solving Simultaneous Equations in Boolean/Switching Algebra Autor Bhattacharjee, Pramode Ranjan

“…This paper reports on a novel method for finding the solution(s) of a set of simultaneous equations in Boolean/Switching algebra. It is based exclusively on…”
Získať plný text

New heuristics and meta-heuristics for the Bandpass problem Autor Gursoy, Arif, Kurt, Mehmet, Kutucu, Hakan, Nuriyev, Urfat

“…The Bandpass problem (BP), modelled by Babayev et al., is a combinatorial optimization problem arising in optical communication networks using wavelength…”
Získať plný text

Direct multiplicative methods for sparse matrices. Newton methods Autor Sviridenko, Anastasiya Borisovna

“…We consider a numerically stable direct multiplicative algorithm of solving linear equations systems, which takes into account the sparseness of matrices…”
Získať plný text

Boolean Programming for Optimal Stopping in American Option Pricing with Reinforcement Learning Autor Kyung, Minsun, Cho, Sung-Woo

“…In this paper, we analyze the effective implementation of Reinforcement Learning for American Option Pricing. We treat American Option Pricing problems as…”
Získať plný text

METHOD OF DISTRIBUTION OF EDUCATIONAL LOAD USING NONLINEAR BOOLEAN PROGRAMMING Autor Minuhin, S. В.

“…An approach to the allocation of teaching load at the university, which is based on the simultaneous integration of several disciplines teachers. It is shown…”
Získať plný text

A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates Autor Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Vialette, Stéphane

“…Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic…”
Zistit podrobnosti o prístupe