Výsledky vyhledávání - linear AND linear boolean programming problems*

  1. 1

    Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality “from Condorcet to Pareto” Autor Nikulin, Yury, Mäkelä, Marko M.

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 16.12.2010
    “…A multicriteria Boolean programming problem with linear cost functions in which initial coefficients of the cost functions are subject to perturbations is considered…”
    Získat plný text
    Journal Article
  2. 2

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

    ISSN: 2227-8486
    Vydáno: Penza State University Publishing House 01.11.2024
    “… Materials and methods. To achieve this goal, the mathematical apparatus for solving linear and linear Boolean programming problems was used. Results…”
    Získat plný text
    Journal Article
  3. 3

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

    ISSN: 0377-2217, 1872-6860
    Vydáno: Elsevier B.V 16.10.2018
    “…•A model suitable for handling take-or-leave decisions is introduced.•The objective is a non-linear non-separable function…”
    Získat plný text
    Journal Article
  4. 4

    PIECEWISE LINEAR REGRESSION MODELS OF PASSENGER TRANSPORTATION VOLUMES BY RAILWAY Autor Noskov, S.I., Khonyakov, A.A.

    ISSN: 2227-8486
    Vydáno: Penza State University Publishing House 01.04.2022
    “… Materials and methods. To achieve the goal of modeling, a piecewise linear regression model with a minimum on the right side, also called the Leontief function, was applied…”
    Získat plný text
    Journal Article
  5. 5

    On complexity of optimal recombination for binary representations of solutions Autor Eremeev, Anton V

    ISSN: 1063-6560
    Vydáno: United States 01.03.2008
    Vydáno v Evolutionary computation (01.03.2008)
    “…, the minimum weight set partition problem, and for linear Boolean programming problems with at most…”
    Zjistit podrobnosti o přístupu
    Journal Article
  6. 6

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

    ISSN: 2072-3059
    Vydáno: Penza State University Publishing House 01.12.2025
    “… The objective of this work is to develop an algorithmic method for identifying the parameters of a cluster-based piecewise linear risk function. Results…”
    Získat plný text
    Journal Article
  7. 7

    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

    ISSN: 2227-8486
    Vydáno: Penza State University Publishing House 01.09.2025
    “… Materials and methods. To achieve the stated goal, the mathematical apparatus for solving linear Boolean programming problems was used. Results…”
    Získat plný text
    Journal Article
  8. 8

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

    ISSN: 2073-6185, 2542-095X
    Vydáno: Dagestan State Technical University 23.01.2024
    “… . Estimation of its unknown parameters is carried out with the help of reduction to the problem of linear Boolean programming…”
    Získat plný text
    Journal Article
  9. 9

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

    ISSN: 2072-3059
    Vydáno: Penza State University Publishing House 01.12.2024
    “…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 possibility of including continuous functions…”
    Získat plný text
    Journal Article
  10. 10

    Solving linear Boolean programming problems with imprecise costs Autor Castro, J.L., Herrera, F., Verdegay, J.L.

    ISBN: 0780302362, 9780780302365
    Vydáno: IEEE 1992
    “…The authors present a fuzzy linear Boolean programming problem with fuzzy costs and propose two different approaches for solving the problem…”
    Získat plný text
    Konferenční příspěvek Journal Article
  11. 11

    Optimization Problems for the Maximum k-Plex Autor Stetsyuk, P. I., Khomiak, O. M., Blokhin, Ye. A., Suprun, A. A.

    ISSN: 1060-0396, 1573-8337
    Vydáno: New York Springer US 01.07.2022
    Vydáno v Cybernetics and systems analysis (01.07.2022)
    “… Two families of superfluous quadratic constraints obtained by means of constraints of the Boolean linear programming problem for the maximum k -plex are presented…”
    Získat plný text
    Journal Article
  12. 12

    Modifications of the Two-Stage Transportation Problem and Their Applications Autor Stetsyuk, P. I., Stovba, V. O., Tregubenko, S. S., Khomiak, O. M.

    ISSN: 1060-0396, 1573-8337
    Vydáno: New York Springer US 01.11.2022
    Vydáno v Cybernetics and systems analysis (01.11.2022)
    “…Mathematical models of linear and Boolean linear programming for the balanced two-stage transportation problem and its two modifications are analyzed…”
    Získat plný text
    Journal Article
  13. 13

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

    ISSN: 2261-2424, 2416-5182, 2261-2424
    Vydáno: Les Ulis EDP Sciences 2021
    Vydáno v SHS web of conferences (2021)
    “… The model of the optimal choice of TIH system is presented in the form of a linear Boolean programming problem…”
    Získat plný text
    Journal Article Konferenční příspěvek
  14. 14
  15. 15

    A Mathematical Model of Diet Menu Problem Based on Boolean Linear Programming Approach Autor Harahap, Latifah Hanum, Nasution, Mahyuddin K. M., Sawaluddin, Sawaluddin

    ISSN: 2541-044X, 2541-2019
    Vydáno: 01.07.2023
    Vydáno v Sinkron (01.07.2023)
    “…This study aims to model the diet menu problem based on a Boolean Linear Programming approach…”
    Získat plný text
    Journal Article
  16. 16

    Using the NEOS Server for Solving Two Classes of Optimization Problems Autor Bila, Halyna, Korchynskyy, Oleksandr, Stetsyuk, Petro, Khomiak, Olha, Shekhovtsov, Serhiy

    ISSN: 2707-4501, 2707-451X
    Vydáno: V.M. Glushkov Institute of Cybernetics 29.12.2022
    “…: a linear Boolean programming problem for the well-known m-traveler problem and nonlinear programming problem for a special multiextremal problem on the Stiefel’s manifold…”
    Získat plný text
    Journal Article
  17. 17

    Adjacent Channel Interference Aware Joint Scheduling and Power Control for V2V Broadcast Communication Autor Hisham, Anver, Yuan, Di, Strom, Erik G., Brannstrom, Fredrik

    ISSN: 1524-9050, 1558-0016, 1558-0016
    Vydáno: New York IEEE 01.01.2021
    “… The joint scheduling and power control problem is formulated as a mixed Boolean linear programming (MBLP) problem…”
    Získat plný text
    Journal Article
  18. 18

    Problems on Shortest k-Node Cycles and Paths Autor Stetsyuk, Petro, Solomon, Dumitru, Grygorak, Maria

    ISSN: 2707-4501, 2707-451X
    Vydáno: V.M. Glushkov Institute of Cybernetics 30.09.2021
    “… Section 1 formulates two problems for finding the shortest k-node cycle – a mixed Boolean and linear programming problem and a discrete programming problem…”
    Získat plný text
    Journal Article
  19. 19

    Tutorial proposal efficient solving of optimization problems using advanced boolean satisfiability and Integer Linear Programming techniques Autor Aloul, Fadi A.

    ISBN: 9781424458141, 1424458145
    ISSN: 2159-1660
    Vydáno: IEEE 01.12.2009
    “…Recent years have seen a tremendous growth in the number of research and development groups at universities, research labs, and companies that have started using Boolean Satisfiability (SAT…”
    Získat plný text
    Konferenční příspěvek
  20. 20

    Strengthening convex relaxations of 0/1-sets using Boolean formulas Autor Fiorini, Samuel, Huynh, Tony, Weltge, Stefan

    ISSN: 0025-5610, 1436-4646
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021
    Vydáno v Mathematical programming (01.11.2021)
    “… On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popular linear programming or semi…”
    Získat plný text
    Journal Article