Výsledky vyhledávání - partial-Boolean linear programming problems

Eature selection in regression models estimated by OLS as a partial boolean linear programming problem: computational experiments

Autoři: Mikhail Pavlovich Bazilevskiy

Zdroj: Information Technology and Mathematical Modeling in the Management of Complex Systems. :1-12

FORMALIZATION OF THE PROBLEM OF CONSTRUCTION OF LINEAR MULTIPLICATIVE REGRESSIONS IN THE FORM OF A PARTIAL-BOOLEAN LINEAR PROGRAMMING PROBLEM

Autoři: M P Bazilevsky S I Noskov

Zdroj: Modern technologies. System analysis. Modeling. 3

Témata: 0502 economics and business, 05 social sciences, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: https://stsam.irgups.ru/2017.3%2855%29.101-105

PIECEWISE LINEAR REGRESSION MODELS OF PASSENGER TRANSPORTATION VOLUMES BY RAILWAY

Autoři: S.I. Noskov A.A. Khonyakov

Zdroj: Модели, системы, сети в экономике, технике, природе и обществе, Iss 4 (2022)

Témata: piecewise linear regression, regressor transformation, boolean partial boolean linear programming problem, railway transport, passenger transportation, Engineering (General). Civil engineering (General), TA1-2040

Popis souboru: electronic resource

Relation: https://doaj.org/toc/2227-8486

Přístupová URL adresa: https://doaj.org/article/c8c8c9977008465aa432888cb680a6ae

Оценивание индексных моделей регрессии с помощью метода наименьших модулей

Témata: index regression, least absolute deviations, partial-Boolean linear programming problem, производственная функция Леонтьева, Leontief production function, индексная регрессия, метод наименьших модулей, задача частично-булевого линейного программирования

Effective adaptive large neighborhood search for a firefighters timetabling problem.

Autoři: Ouberkouk, Mohamed-Amine Boufflet, Jean-Paul Moukrim, Aziz

Zdroj: Journal of Heuristics; Dec2023, Vol. 29 Issue 4-6, p545-580, 36p

Témata: FIRE fighters, WILDFIRE prevention, NEIGHBORHOODS, LINEAR programming, INTEGER programming, FOREST fires, FOREST fire ecology

Geografický termín: ANDALUSIA (Spain)

ГРУППОВОЙ ОТБОР ИНФОРМАТИВНЫХ ПЕРЕМЕННЫХ В РЕГРЕССИОННЫХ МОДЕЛЯХ: GROUP SELECTION OF INFORMATIVE VARIABLES IN REGRESSION MODELS

Zdroj: Южно-Сибирский научный вестник. 1

Témata: спецификация модели, the specification of the model, the problem of partial Boolean linear programming, The regression equation, Регрессионное уравнение, информативные переменные, informa-tive variables, задача частично-булевого линейного программирования

A New Minimax Theorem for Randomized Algorithms.

Autoři: BEN-DAVID, SHALEV BLAIS, ERIC

Zdroj: Journal of the ACM; Dec2023, Vol. 70 Issue 6, p1-58, 58p

Témata: ALGORITHMS, LINEAR programming, QUANTUM communication, BILINEAR forms, CHEBYSHEV approximation, CIRCUIT complexity, QUANTUM computing

People: VON Neumann, John, 1903-1957

Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search.

Autoři: Devriendt, Jo Gleixner, Ambros Nordström, Jakob

Zdroj: Constraints: An International Journal; Oct2021, Vol. 26 Issue 1-4, p26-55, 30p

Representations of Monotone Boolean Functions by Linear Programs

Autoři: Mateus De Oliveira Oliveira Pavel Pudlák Mateus de Oliveira Oliveira and Pavel Pudlák

Přispěvatelé: Mateus De Oliveira Oliveira Pavel Pudlák Mateus de Oliveira Oliveira and Pavel Pudlák

Zdroj: ACM Transactions on Computation Theory. 11:1-31

Témata: Lower Bounds, monotone linear programming circuits, Feasible Interpolation, Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Lovász-Schrijver proof systems, feasible interpolation, 0102 computer and information sciences, ddc:004, Cutting-Planes Proof System, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7520/pdf/LIPIcs-CCC-2017-3.pdf
https://dl.acm.org/doi/10.5555/3135595.3135598
https://drops.dagstuhl.de/opus/volltexte/2017/7520/
https://dblp.uni-trier.de/db/conf/coco/coco2017.html#OliveiraP17
https://dblp.uni-trier.de/db/journals/toct/toct11.html#OliveiraP19
https://dl.acm.org/doi/10.1145/3337787
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3
http://hdl.handle.net/11104/0301620
http://hdl.handle.net/11104/0273491

APPLYING THE RISK FUNCTION TO MODEL ECONOMIC SYSTEMS

Zdroj: Южно-Сибирский научный вестник.

Témata: функция риска, risk function, least modulus, регрессия, regression, partial boolean linear programming, частично булево линейное программирование, метод наименьших модулей

Representations of Monotone Boolean Functions by Linear Programs

Autoři: de Oliveira Oliveira, Mateus Pudlák, Pavel Mateus de Oliveira Oliveira and Pavel Pudlák

Přispěvatelé: de Oliveira Oliveira, Mateus Pudlák, Pavel Mateus de Oliveira Oliveira and Pavel Pudlák

Témata: Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Cutting-Planes Proof System, Feasible Interpolation, Lower Bounds

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3

Dostupnost: https://doi.org/10.4230/LIPIcs.CCC.2017.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-75200
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3

Representations of Monotone Boolean Functions by Linear Programs

Autoři: Mateus de Oliveira Oliveira and Pavel Pudlák de Oliveira Oliveira, Mateus Pudlák, Pavel

Témata: Monotone Linear Programming Circuits, Lovász-Schrijver Proof System, Cutting-Planes Proof System, Feasible Interpolation, Lower Bounds, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.3
Is Part Of LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017)

TWO METHODS FOR CONSTRUCTION OF SUBOPTIMISTIC AND SUBPESSIMISTIC SOLUTIONS OF THE INTERVAL PROBLEM OF MIXED-BOOLEAN PROGRAMMING.

Alternate Title: ДВА МЕТОДА ДЛЯ ПОСТРОЕНИЯ СУБОПТИМИСТИЧЕСКОГО И СУБПЕССИМИСТИЧЕСКОГО РЕШЕНИЙ ИНТЕРВАЛЬНОЙ ЗАДАЧИ ЧАСТИЧНО-БУЛЕВОГО ПРОГРАММИРОВАНИЯ (Russian)
ДВА МЕТОДУ ДЛЯ ПОБУДОВИ СУБОПТІМІСТІЧЕСКОГО І СУБПЕССІМІСТІЧЕСКОГО РІШЕНЬ ІНТЕРВАЛЬНОГО ЗАВДАННЯ ЧАСТКОВО-БУЛЕВОГО ПРОГРАМУВАННЯ (Ukrainian)

Autoři: Mamedov, К. Sh. Mammadli, N. O.

Zdroj: Radio Electronics, Computer Science, Control; 2018, Issue 3, p57-67, 11p

Témata: INTEGER programming, BOOLEAN functions, ALGORITHMS

GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS.

Autoři: POLOCZEK, MATTHIAS SCHNITGER, GEORG WILLIAMSON, DAVID P. a další

Zdroj: SIAM Journal on Computing; 2017, Vol. 46 Issue 3, p1029-1061, 33p

Témata: APPROXIMATION algorithms, GREEDY algorithms, SATISFIABILITY (Computer science)

Pseudo-Deterministic Query Complexity of Search Problems.

Autoři: Chattopadhyay, Arkadev Dahiya, Yogesh Mahajan, Meena

Zdroj: Computational Complexity; Dec2025, Vol. 34 Issue 2, p1-57, 57p

An Iterated Local Search Heuristic for the Staff Scheduling Problem for Part-Time Employees in Japan.

Autoři: Wu, Wei Katoh, Naoaki Ikegami, Atsuko

Zdroj: Asia-Pacific Journal of Operational Research; Oct2022, Vol. 39 Issue 5, p1-20, 20p

Témata: PROBLEM employees, PART-time employees, HEURISTIC, MATHEMATICAL programming, DYNAMIC programming

Geografický termín: JAPAN

Modeling and solving staff scheduling with partial weighted maxSAT.

Autoři: Demirović, Emir Musliu, Nysret Winter, Felix

Zdroj: Annals of Operations Research; Apr2019, Vol. 275 Issue 1, p79-99, 21p

Témata: NURSES, COMPUTER scheduling, INTEGER programming, HEURISTIC algorithms, MATHEMATICAL programming

SEMIALGEBRAIC PROOFS, IPS LOWER BOUNDS, AND THE τ-CONJECTURE: CAN A NATURAL NUMBER BE NEGATIVE?

Autoři: ALEKSEEV, YAROSLAV GRIGORIEV, DIMA HIRSCH, EDWARD A. a další

Zdroj: SIAM Journal on Computing; 2024, Vol. 53 Issue 3, p648-700, 53p

Témata: VALUE capture, LINEAR equations, NATURAL numbers, SUM of squares, CIRCUIT complexity, BOOLEAN functions

Pseudo-Boolean Conditional Optimization Models for a Class of Multiple Traveling Salesmen Problems.

Autoři: Germanchuk, M. S. Kozlova, M. G. Lukianenko, V. A.

Zdroj: Automation & Remote Control; Oct2021, Vol. 82 Issue 10, p1651-1667, 17p

Témata: TRAVELING salesman problem, PROBLEM solving, CONSTRAINT algorithms, ROUTING algorithms, MATHEMATICAL optimization, METAHEURISTIC algorithms

Implementation of a System of Incompletely Specified Boolean Functions in a Circuit of Two-Input Gates by Means of Bi-Decomposition.

Autoři: Pottosin, Yu. V.

Zdroj: Journal of Computer & Systems Sciences International; Apr2024, Vol. 63 Issue 2, p298-309, 12p