Výsledky vyhledávání - boolean partial boolean linear programming problems
-
1
PIECEWISE LINEAR REGRESSION MODELS OF PASSENGER TRANSPORTATION VOLUMES BY RAILWAY
ISSN: 2227-8486Vydáno: Penza State University Publishing House 01.04.2022Vydáno v Модели, системы, сети в экономике, технике, природе и обществе (01.04.2022)“…Background. The paper deals with the problem of modeling the transportation of passengers by rail, depending on the indicators characterizing the results of the functioning of the tourism industry…”
Získat plný text
Journal Article -
2
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
ISSN: 1076-9757, 1076-9757, 1943-5037Vydáno: San Francisco AI Access Foundation 01.01.2010Vydáno v The Journal of artificial intelligence research (01.01.2010)“… We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming…”
Získat plný text
Journal Article -
3
Identification of Boolean Network Models From Time Series Data Incorporating Prior Knowledge
ISSN: 1664-042X, 1664-042XVydáno: Switzerland Frontiers Media S.A 08.06.2018Vydáno v Frontiers in physiology (08.06.2018)“… Since length of a time series and number of replicates is limited by the cost of experiments, Boolean networks as a structurally simple and parameter-free logical model for gene regulatory networks…”
Získat plný text
Journal Article -
4
On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
ISSN: 1561-4042Vydáno: Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.09.2006Vydáno v Computer science journal of Moldova (01.09.2006)“…We consider a multi-criterion Boolean programming problem with partial criteria of the kind MIN MODUL of linear functions…”
Získat plný text
Journal Article -
5
Radix-2r recoding with common subexpression elimination for multiple constant multiplication
ISSN: 1751-858X, 1751-8598, 1751-8598Vydáno: Stevenage The Institution of Engineering and Technology 01.10.2020Vydáno v IET circuits, devices & systems (01.10.2020)“…In a recent work on multiple constant multiplication (MCM) problems, a fully predictable sub-linear runtime heuristic was introduced, called Radix-2r MCM…”
Získat plný text
Journal Article -
6
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 16.01.2014Vydáno v arXiv.org (16.01.2014)“… We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming…”
Získat plný text
Paper -
7
Application driven inverse type constraint satisfaction problems
ISSN: 1054-6618, 1555-6212Vydáno: Moscow Pleiades Publishing 01.07.2017Vydáno v Pattern recognition and image analysis (01.07.2017)“…Mathematical science in tight integration with the natural and life sciences provide sophisticated models and algorithms of knowledge acquisition. Overall…”
Získat plný text
Journal Article -
8
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications
ISSN: 0278-0070, 1937-4151Vydáno: New York IEEE 01.06.2008Vydáno v IEEE transactions on computer-aided design of integrated circuits and systems (01.06.2008)“…). We model this problem as a Boolean network that covers all possible partial terms that may be used to generate the set of coefficients in the MCM instance…”
Získat plný text
Journal Article -
9
A capacitated competitive facility location problem
ISSN: 1990-4789, 1990-4797Vydáno: Moscow Pleiades Publishing 01.01.2016Vydáno v Journal of applied and industrial mathematics (01.01.2016)“… It is shown that the problem can be reformulated as that of maximization of a pseudo-Boolean function with the number of arguments equal to the number of places available for facility opening…”
Získat plný text
Journal Article -
10
Computing linear extensions for polynomial posets subject to algebraic constraints
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 03.03.2021Vydáno v arXiv.org (03.03.2021)“… We provide an algorithm for solving this problem using linear programming for arbitrary partial orders of linear polynomials…”
Získat plný text
Paper -
11
On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem
ISSN: 2457-6794, 2501-059XVydáno: Publishing House of the Romanian Academy 01.02.2001Vydáno v Journal of numerical analysis and approximation theory (01.02.2001)“…We consider a vector Boolean programming problem with the linear-quadratic partial criteria…”
Získat plný text
Journal Article -
12
On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem
ISSN: 2457-6794, 2501-059XVydáno: Publishing House of the Romanian Academy 01.02.2001Vydáno v Journal of numerical analysis and approximation theory (01.02.2001)“…We consider a vector Boolean programming problem with the linear-quadratic partial criteria…”
Získat plný text
Journal Article -
13
Methods of automated control over composition and structure of metalworking equipment
ISSN: 2261-236X, 2274-7214, 2261-236XVydáno: Les Ulis EDP Sciences 01.01.2018Vydáno v MATEC web of conferences (01.01.2018)“… The generated mathematical model is defined on the set of Boolean variables and implemented using linear programming methods…”
Získat plný text
Journal Article Konferenční příspěvek -
14
Stability Radius of a Lexicographic Optimum of a Vector Problem of Boolean Programming
ISSN: 1060-0396, 1573-8337Vydáno: New York Springer Nature B.V 01.03.2005Vydáno v Cybernetics and systems analysis (01.03.2005)“…A Boolean problem of vector lexicographic optimization is considered. Its partial criteria are projections of linear functions on the nonnegative orthant…”
Získat plný text
Journal Article -
15
Dual-bounded generating problems: weighted transversals of a hypergraph
ISSN: 0166-218X, 1872-6771Vydáno: Elsevier B.V 15.08.2004Vydáno v Discrete Applied Mathematics (15.08.2004)“… Weighted transversals generalize partial and multiple transversals introduced in Boros et al. (SIAM J. Comput. 30 (6) (2001…”
Získat plný text
Journal Article -
16
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2001Vydáno v SIAM journal on computing (01.01.2001)“… Multiple transversals naturally arise in 0-1 programming, while partial transversals are related to data mining and machine learning…”
Získat plný text
Journal Article -
17
Combinatorial structure and randomized subexponential algorithms for infinite games
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 16.12.2005Vydáno v Theoretical computer science (16.12.2005)“… We show that the subexponential algorithms for combinatorial linear programming, due to Kalai…”
Získat plný text
Journal Article -
18
Design and Development of Global Optimization Methods with Applications
ISBN: 9798381061840Vydáno: ProQuest Dissertations & Theses 01.01.2019“… fit a problem than others, selecting the most appropriate algorithm or theoretical concept to solve a problem can be challenging…”
Získat plný text
Dissertation -
19
Compact and Efficient Encodings for Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 06.03.2020Vydáno v arXiv.org (06.03.2020)“… Maximum Boolean Satisfiability (FD-SAT-Plan+) as well as Binary Linear Programming (FD-BLP-Plan+). Theoretically, we show that our SAT-based Bi-Directional Neuron…”
Získat plný text
Paper -
20
A special role of Boolean quadratic polytopes among other combinatorial polytopes
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 05.03.2015Vydáno v arXiv.org (05.03.2015)“…: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment…”
Získat plný text
Paper

