To see the other types of publications on this topic, follow the link: 0–1 integer linear programming (ILP).

Journal articles on the topic '0–1 integer linear programming (ILP)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic '0–1 integer linear programming (ILP).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Arefin, Md Rajib, Touhid Hossain, and Md Ainul Islam. "Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem." Dhaka University Journal of Science 61, no. 2 (2013): 173–78. http://dx.doi.org/10.3329/dujs.v61i2.17066.

Full text
Abstract:
In this paper, we present additive algorithm for solving a class of 0-1 integer linear fractional programming problems (0-1 ILFP) where all the coefficients at the numerator of the objective function are of same sign. The process is analogous to the process of solving 0-1 integer linear programming (0-1 ILP) problem but the condition of fathoming the partial feasible solution is different from that of 0-1 ILP. The procedure has been illustrated by two examples. DOI: http://dx.doi.org/10.3329/dujs.v61i2.17066 Dhaka Univ. J. Sci. 61(2): 173-178, 2013 (July)
APA, Harvard, Vancouver, ISO, and other styles
2

Ahmed, Waleed, and Ali Muhammad Ali Rushdi. "1 A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution." Sir Syed Research Journal of Engineering & Technology 1, no. 1 (2018): 7. http://dx.doi.org/10.33317/ssurj.v1i1.37.

Full text
Abstract:
The tasks of guard placement or sensor deployment in an art gallery, a museum or in the corridors of public and security buildings pose the same problem, which requires placing the guards or sensors so as to cover a specified set of nodes with a minimum number of sensors or guards, thereby reducing the overall cost of the system as well assist power consumption. Generally, minimization can be done using optimization techniques such as linear programming, but in case of sensor deployment or guard placement there is a need either to place or not to place the sensor or guard, and hence only Boole
APA, Harvard, Vancouver, ISO, and other styles
3

Ahmed, Waleed, and Ali Muhammad Ali Rushdi. "A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution." Sir Syed University Research Journal of Engineering & Technology 7, no. 1 (2018): 7. http://dx.doi.org/10.33317/ssurj.v7i1.37.

Full text
Abstract:
The tasks of guard placement or sensor deployment in an art gallery, a museum or in the corridors of public and security buildings pose the same problem, which requires placing the guards or sensors so as to cover a specified set of nodes with a minimum number of sensors or guards, thereby reducing the overall cost of the system as well assist power consumption. Generally, minimization can be done using optimization techniques such as linear programming, but in case of sensor deployment or guard placement there is a need either to place or not to place the sensor or guard, and hence only Boole
APA, Harvard, Vancouver, ISO, and other styles
4

Ahmed, Waleed, and Ali Muhammad Ali Rushdi. "A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution." Sir Syed University Research Journal of Engineering & Technology 7, no. 1 (2018): 7. http://dx.doi.org/10.33317/ssurj.37.

Full text
Abstract:
The tasks of guard placement or sensor deployment in an art gallery, a museum or in the corridors of public and security buildings pose the same problem, which requires placing the guards or sensors so as to cover a specified set of nodes with a minimum number of sensors or guards, thereby reducing the overall cost of the system as well assist power consumption. Generally, minimization can be done using optimization techniques such as linear programming, but in case of sensor deployment or guard placement there is a need either to place or not to place the sensor or guard, and hence only Boole
APA, Harvard, Vancouver, ISO, and other styles
5

Ahmed, Osman, Sagahyroon Assim, Aburukba Raafat, and Aloul Fadi. "Optimization of energy consumption in cloud computing datacenters." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 1 (2021): 686–98. https://doi.org/10.11591/ijece.v11i1.pp686-698.

Full text
Abstract:
Cloud computing has emerged as a practical paradigm for providing IT resources, infrastructure and services. This has led to the establishment of datacenters that have substantial energy demands for their operation. This work investigates the optimization of energy consumption in cloud datacenter using energy efficient allocation of tasks to resources. The work seeks to develop formal optimization models that minimize the energy consumption of computational resources and evaluates the use of existing optimization solvers in testing these models. Integer linear programming (ILP) techniques are
APA, Harvard, Vancouver, ISO, and other styles
6

YILDIZ, Çağdaş, and Adem TÜZEMEN. "A Solution Proposal to Vehicle Routing Problem with Integer Linear Programming: A Distributor Company Sample." International Journal of Contemporary Economics and Administrative Sciences 9, no. 1 (2019): 46–78. https://doi.org/10.5281/zenodo.3262231.

Full text
Abstract:
<strong>Abstract </strong> It was aimed to minimize the total distance of the routes under the capacity constraint of the routes that a distributor company has drawn in the direction of the demands. To this end, a route to Gebze-based steel production and distribution was drawn up to meet all the demands of a fabrication plant. In order to determine the minimum total distance routes, the solution recommendation by adapting the Capacity Constrained Vehicle Routing Problem (CVRP) which is one of the basic route problems using Branch and Cut algorithm of 0-1 Integer Linear Programming (ILP) was i
APA, Harvard, Vancouver, ISO, and other styles
7

Osman, Ahmed, Assim Sagahyroon, Raafat Aburukba, and Fadi Aloul. "Optimization of energy consumption in cloud computing datacenters." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 1 (2021): 686. http://dx.doi.org/10.11591/ijece.v11i1.pp686-698.

Full text
Abstract:
Cloud computing has emerged as a practical paradigm for providing IT resources, infrastructure and services. This has led to the establishment of datacenters that have substantial energy demands for their operation. This work investigates the optimization of energy consumption in cloud datacenter using energy efficient allocation of tasks to resources. The work seeks to develop formal optimization models that minimize the energy consumption of computational resources and evaluates the use of existing optimization solvers in testing these models. Integer linear programming (ILP) techniques are
APA, Harvard, Vancouver, ISO, and other styles
8

SAGAHYROON, ASSIM, FADI A. ALOUL, and ALEXANDER SUDNITSON. "USING SAT-BASED TECHNIQUES IN LOW POWER STATE ASSIGNMENT." Journal of Circuits, Systems and Computers 20, no. 08 (2011): 1605–18. http://dx.doi.org/10.1142/s0218126611007980.

Full text
Abstract:
Power consumption of synchronous sequential circuits can be reduced by careful encoding of the states of the circuit. The idea is to reduce the average number of bit changes per state transition by finding an optimal state assignment. This state assignment problem is NP-hard, and existing techniques rely mainly on heuristic-based methods. The primary goal of this work is to assess the suitability of using complete advanced Boolean Satisfiability and Integer Linear Programming (ILP) methods in finding an optimized solution. We formulate the problem as a 0-1 ILP instance with power minimization
APA, Harvard, Vancouver, ISO, and other styles
9

CHOI, YOONSEO, and TAEWHAN KIM. "MEMORY ACCESS DRIVEN STORAGE ASSIGNMENT FOR VARIABLES IN EMBEDDED SYSTEM DESIGN." Journal of Circuits, Systems and Computers 15, no. 02 (2006): 145–68. http://dx.doi.org/10.1142/s0218126606003003.

Full text
Abstract:
In this paper, we address the DRAM storage assignment problems of variables with an objective of maximizing the number of page/burst mode accesses. Specifically, (1) we solve the problem of variable alignment to memory for maximizing the use of page accesses by proposing a technique, called zone_alignment, which is based on the combination of an efficient 0-1 ILP (integer linear programming) formulation and the utilization of temporal locality of variables' accesses in code and (2) the approach used in (1) is then applied to solve the problem of variable alignment for maximizing the use of bur
APA, Harvard, Vancouver, ISO, and other styles
10

Di, Zhen, Shihui Zhang, Ayijiang Babayi, Yuhang Zhou, and Shenghu Zhang. "Eco-Driving Optimization with the Traffic Light Countdown Timer in Vehicle Navigation and Its Impact on Fuel Consumption." Sustainability 17, no. 8 (2025): 3354. https://doi.org/10.3390/su17083354.

Full text
Abstract:
For most drivers of fuel-powered vehicles who do not have specialized eco-driving knowledge, simple and practical strategies are the most effective way to encourage eco-driving habits. By incorporating traffic light countdown timers from vehicle navigation systems, this paper develops a 0–1 integer linear programming (ILP) model to determine the optimal speed curve and further provide actionable, easy-to-implement eco-driving recommendations. Specifically, time is discretized into one-second intervals, with speed and acceleration also discretized. Pre-calculating instantaneous fuel consumption
APA, Harvard, Vancouver, ISO, and other styles
11

Elfouly, Fatma H., Rabie A. Ramadan, Mohamed I. Mahmoud, and Moawad I. Dessouky. "Efficient Data Reporting in a Multi-Object Tracking Using WSNs." International Journal of System Dynamics Applications 6, no. 1 (2017): 38–57. http://dx.doi.org/10.4018/ijsda.2017010103.

Full text
Abstract:
Object tracking is one of the most important applications in wireless sensor networks (WSNs). Many recent articles have been dedicated to localization of objects; however, few of these articles were concentrated on the reliability of network data reporting along with objects localization. In this work, the authors propose an efficient data reporting method for object tracking in WSNs. This paper aims to achieve both minimum energy consumption in reporting operation and balanced energy consumption among sensor nodes for WSN lifetime extension. Furthermore, data reliability is considered in the
APA, Harvard, Vancouver, ISO, and other styles
12

Adelino, Muhammad Ilham. "Perencanaan Komposisi Pengadaan Rangkaian Kereta Cepat: Studi Kasus di Indonesia." Jurnal Penelitian Transportasi Darat 25, no. 1 (2023): 14–25. http://dx.doi.org/10.25104/jptd.v25i1.2027.

Full text
Abstract:
Mega proyek kereta cepat (HSR) Indonesia pada rute Jakarta-Bandung direncanakan mulai beroperasi di Indonesia. Tipe HSR yang digunakan adalah generasi terbaru dari CRRC Qindao Sifang. Sebelum beroperasi, pengadaan jumlah unit HSR awal menjadi faktor yang krusial sehingga perlu dilakukan perencanaan dan proyeksi yang tepat. Tujuan penelitian ini adalah merencanakan komposisi pengadaan rangkaian kereta cepat (HSR) rute Jakarta-Bandung pada awal operasional. Metode yang digunakan adalah Integer Linear Programming (ILP) untuk menentukan komposisi pengadaan rangkaian HSR yang optimal untuk setiap s
APA, Harvard, Vancouver, ISO, and other styles
13

Singamsetty, Purusotham, and Jayanth Kumar Thenepalle. "An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint." Decision Science Letters 10, no. 4 (2021): 525–34. http://dx.doi.org/10.5267/j.dsl.2021.5.003.

Full text
Abstract:
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travelling salesman problem and its variants. In this paper, an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) is addressed. The OMTSPLB differs from the conventional MTSP, in which all the salesmen start from the central depot and need not come back to it after visiting t
APA, Harvard, Vancouver, ISO, and other styles
14

Ramani, A., I. L. Markov, K. A. Sakallah, and F. A. Aloul. "Breaking Instance-Independent Symmetries In Exact Graph Coloring." Journal of Artificial Intelligence Research 26 (July 31, 2006): 289–322. http://dx.doi.org/10.1613/jair.1637.

Full text
Abstract:
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning, time-tabling and scheduling. Provably optimal solutions may be desirable for commercial and defense applications. Additionally, for applications such as register allocation and code optimization, naturally-occurring instances of graph coloring are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean
APA, Harvard, Vancouver, ISO, and other styles
15

Arquette, David M., and Dursun A. Bulutoglu. "The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program." LMS Journal of Computation and Mathematics 19, no. 1 (2016): 206–16. http://dx.doi.org/10.1112/s1461157016000085.

Full text
Abstract:
There is always a natural embedding of $S_{s}\wr S_{k}$ into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to prove that in the $2$-level, strength-$1$ case the LP relaxation permutation symmetry group of this formulation is isomorphic to $S_{2}\wr S_{k}$ for all $k$, and in the $2$-level, strength-$2$ case it is isomorphic to $S_{2}^{k}\rtimes S_{k+1}$ for $k\geqslant 4$. The strength-$2$ result reveals previously unknown permutation symmetries that can
APA, Harvard, Vancouver, ISO, and other styles
16

Hikmah, Hikmah, and Nusyafitri Amin. "Aplikasi Integer Linear Programming (Ilp) untuk Meminimumkan Biaya Produksi pada Siaputo Aluminium." SAINTIFIK 3, no. 2 (2017): 128–35. http://dx.doi.org/10.31605/saintifik.v3i2.152.

Full text
Abstract:
Penelitian ini bertujuan untuk menyelesaikan masalah optimisasi, khusunya meminimumkan biaya produksi dengan menggunakan Integer Linear Programming (ILP). Penelitian dilaksanakan pada salah satu usaha pembuatan lemari aluminium di Majene dan melakukan wawancara langsung dengan pemilik usaha tersebut. Langkah-langkah proses penelitian ini meliputi: (1) mengumpulkan data dengan wawancara, (2) menyusun model matematika yaitu menentukan fungsi tujuan dan fungsi kendala, dan (3) menyelesaikan masalah. Pada langkah menyelesaikan masalah, peneliti menggunakan metode Branch and Bound, selanjutnya meng
APA, Harvard, Vancouver, ISO, and other styles
17

Makhija, Neha, and Wolfgang Gatterbauer. "A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations." Proceedings of the ACM on Management of Data 1, no. 4 (2023): 1–27. http://dx.doi.org/10.1145/3626715.

Full text
Abstract:
What is a minimal set of tuples to delete from a database in order to eliminate all query answers? This problem is called "the resilience of a query" and is one of the key algorithmic problems underlying various forms of reverse data management, such as view maintenance, deletion propagation and causal responsibility. A long-open question is determining the conjunctive queries (CQs) for which resilience can be solved in PTIME. We shed new light on this problem by proposing a unified Integer Linear Programming (ILP) formulation. It is unified in that it can solve both previously studied restric
APA, Harvard, Vancouver, ISO, and other styles
18

Li, Yuanbo, Qirun Zhang, and Thomas Reps. "Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming." Proceedings of the ACM on Programming Languages 7, POPL (2023): 1003–26. http://dx.doi.org/10.1145/3571228.

Full text
Abstract:
An interleaved-Dyck (InterDyck) language consists of the interleaving of two or more Dyck languages, where each Dyck language represents a set of strings of balanced parentheses.InterDyck-reachability is a fundamental framework for program analyzers that simultaneously track multiple properly-matched pairs of actions such as call/return, lock/unlock, or write-data/read-data.Existing InterDyck-reachability algorithms are based on the well-known tabulation technique. This paper presents a new perspective on solving InterDyck-reachability. Our key observation is that for the single-source-single-
APA, Harvard, Vancouver, ISO, and other styles
19

Seboni, Lone, and Kealeboga Moreri. "A Practical Application of the Analytic Hierarchy Process and Integer Linear Programming for Fuzzy Front-End Project Selection." Mathematical Problems in Engineering 2022 (October 27, 2022): 1–10. http://dx.doi.org/10.1155/2022/6361847.

Full text
Abstract:
Purpose. This study applies a novel approach that integrates AHP with integer linear programming (ILP), to address a gap in management literature regarding the need to consider both sustainability and COVID-19 impact on project selection, with a view to avoid implementation failures. Design/Methodology/Approach. A case study approach involving experts in semiconductor manufacturing was conducted, using the Delphi method, to determine weights of various criteria, including additional new criteria associated with both sustainability and COVID-19 issues considered in the selection decision for fo
APA, Harvard, Vancouver, ISO, and other styles
20

Yan, Jin-Tai. "An ILP Formulation for Minimizing the Number of Feedthrough Cells in a Standard Cell Placement." VLSI Design 10, no. 2 (1999): 169–76. http://dx.doi.org/10.1155/1999/59138.

Full text
Abstract:
It is well known that standard cells have been widely used to implement VLSI circuits in the automation of physical design. Since one major aim of a cell-based design is to minimize total layout area in a standard cell placement, the number of feedthrough cells will be minimized to reduce total cell area in a standard cell placement. In this paper, first, we model a partitioning-based row assignment (PRA) problem to minimize the number of feedthrough cells in a standard cell placement. Furthermore, an integer linear programming (ILP) approach is proposed to solve the PRA problem in a standard
APA, Harvard, Vancouver, ISO, and other styles
21

Bazilevskiy, Mikhail P. "Construction of quite interpretable non-elementary linear regression models." Yugra State University Bulletin 18, no. 4 (2023): 105–14. http://dx.doi.org/10.18822/byusu202204105-114.

Full text
Abstract:
Subject of research: mixed-integer 0-1 linear programming problem for choosing optimal structures for non-elementary linear regression models.&#x0D; Purpose of research: integrate into the mixed-integer 0-1 linear programming problem additional constraints that will guarantee the construction of quite interpretable non-elementary linear regressions.&#x0D; Methods of research: regression analysis, mathematical programming, method of successive increase the absolute contributions of variables to the general determination.&#x0D; Object of research: non-elementary linear regression models.&#x0D; M
APA, Harvard, Vancouver, ISO, and other styles
22

Kito, Nobutaka. "Automatic Cell Placement for Josephson Transmission Lines in a Cell-Based Layout Design Environment for RSFQ Circuits." Journal of Physics: Conference Series 2776, no. 1 (2024): 012008. http://dx.doi.org/10.1088/1742-6596/2776/1/012008.

Full text
Abstract:
Abstract This study proposes a method for automatically tiling appropriate Josephson transmission line (JTL) cells for a given set of paths. Digital RSFQ circuits have been commonly designed in a cell-based design environment. The RSFQ cell library contains pre-designed fragments of JTLs as cells. Appropriate JTL cells are selected and tiled. This method formulates the problem as an instance of integer linear programming (ILP). Subsequently, instances are solved using a solver program. The method generates the tiling of cells according to the solver result. The number of Josephson junctions fo
APA, Harvard, Vancouver, ISO, and other styles
23

Crema, Alejandro. "The multiparametric 0–1-integer linear programming problem: A unified approach." European Journal of Operational Research 139, no. 3 (2002): 511–20. http://dx.doi.org/10.1016/s0377-2217(01)00163-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Soylu, Banu. "Heuristic approaches for biobjective mixed 0–1 integer linear programming problems." European Journal of Operational Research 245, no. 3 (2015): 690–703. http://dx.doi.org/10.1016/j.ejor.2015.04.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Monfroglio, Angelo. "Polynomial-Time 0-1 Linear Programming Approach to CNF-SAT Using Totally Unimodular Matrices." Asian Research Journal of Mathematics 21, no. 6 (2025): 22–29. https://doi.org/10.9734/arjom/2025/v21i6939.

Full text
Abstract:
Efficient 0-1 Linear Programming Approach for CNF-SAT Based on Unimodularity. CNF-SAT, i.e, the satisfaction of a Conjunctive Normal Form, is considered of NP complexity. It can be formulated as an Integer Programmining problem. This short paper presents a 0-1 Linear Programming relaxation which solves CNF-SAT in polynomial time. Main novel contribution is that the structure of the A matrix for the Simplex algorithm guaranties that the solution is always integer, because the matrix is totally unimodular. Thus, this result is important from the comlexity point of view. CNF-SAT is the model of s
APA, Harvard, Vancouver, ISO, and other styles
26

Zhang, Xinyan. "Analysis of practical applications using the linear programming model." Theoretical and Natural Science 25, no. 1 (2023): 246–54. http://dx.doi.org/10.54254/2753-8818/25/20240979.

Full text
Abstract:
A linear programming model is a mathematical optimization technique used to find the best possible outcome in a mathematical model with linear relationships under a set of constraints. This technique has various applications in engineering, management, economic analysis, and military operations. The linear programming model is the most popular technique for determining the best course of action, and it is essential for decision-making and resource allocation in modern society. This research paper will introduce the standard form of the linear programming model and explore the differences and s
APA, Harvard, Vancouver, ISO, and other styles
27

Mehmanchi, Erfan, Colin P. Gillen, Andrés Gómez, and Oleg A. Prokopyev. "On Robust Fractional 0-1 Programming." INFORMS Journal on Optimization 2, no. 2 (2020): 96–133. http://dx.doi.org/10.1287/ijoo.2019.0025.

Full text
Abstract:
We study single- and multiple-ratio robust fractional 0-1 programming problems (RFPs). In particular, this work considers RFPs under a wide range of disjoint and joint uncertainty sets, where the former implies separate uncertainty sets for each numerator and denominator and the latter accounts for different forms of interrelatedness between them. We first demonstrate that unlike the deterministic case, a single-ratio RFP is nondeterministic polynomial-time hard under general polyhedral uncertainty sets. However, if the uncertainty sets are imbued with a certain structure, variants of the well
APA, Harvard, Vancouver, ISO, and other styles
28

Kim, Kwangsoo, and Hong Seo Ryoo. "Nonlinear separation of data via Mixed 0–1 Integer and Linear Programming." Applied Mathematics and Computation 193, no. 1 (2007): 183–96. http://dx.doi.org/10.1016/j.amc.2007.03.067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Peng, Yifei, Tigang Jiang, Xiaodong Tu, Bolin Huang, Zheng Guo, and Du Xu. "Research on Low-Latency TTP–TSN Cross-Domain Network Planning Problem." Electronics 14, no. 1 (2025): 203. https://doi.org/10.3390/electronics14010203.

Full text
Abstract:
With services becoming increasingly complex and network scales expanding, hybrid network architectures that combine bus and switch networks while supporting deterministic transmission will play a crucial role in future networks. Time-Triggered Protocol (TTP) and Time-Sensitive Networking (TSN), as key protocols currently ensuring time determinism in bus and switch networks, respectively, are of significant importance for research on hybrid network architectures and ensuring deterministic communication across protocols. In this paper, firstly, we analyzed the causes of latency in TTP–TSN hybrid
APA, Harvard, Vancouver, ISO, and other styles
30

Bazilevskiy, Mikhail. "Control of Autocorrelation of Residuals Using the Fechner Coefficient in a Mathematical Programming Problem for Subset Selection in Linear Regression." System Analysis & Mathematical Modeling 6, no. 2 (2024): 146–58. https://doi.org/10.17150/2713-1734.2024.6(2).146-158.

Full text
Abstract:
This article is devoted to the problem of subset selection in linear regression estimated using the ordinary least squares method. Previously, this problem was formalized as a mixed 0-1 integer linear programming problem. The target function in it is the value of the coefficient of determination, and linear restrictions allow one to control such characteristics as the absolute contributions of variables to the overall determination, Student’s criterion, variance inflation factors, and inter-correlation coefficients. The purpose of this article is to expand the mixed 0-1 integer linear programm
APA, Harvard, Vancouver, ISO, and other styles
31

Bazilevskiy, Mikhail Pavlovich. "Program for Constructing Quite Interpretable Elementary and Non-elementary Quasi-linear Regression Models." Proceedings of the Institute for System Programming of the RAS 35, no. 4 (2023): 129–44. http://dx.doi.org/10.15514/ispras-2023-35(4)-7.

Full text
Abstract:
A quite interpretable linear regression satisfies the following conditions: the signs of its coefficients correspond to the meaningful meaning of the factors; multicollinearity is negligible; coefficients are significant; the quality of the model approximation is high. Previously, to construct such models, estimated using the ordinary least squares, the QInter-1 program was developed. In it, according to the given initial parameters, the mixed integer 0-1 linear programming task is automatically generated, as a result of which the most informative regressors are selected. The mathematical appa
APA, Harvard, Vancouver, ISO, and other styles
32

Sun, Yu, Jingyu Zhu, Xiao Xu, et al. "Win-Win: On Simultaneous Clustering and Imputing over Incomplete Data." Proceedings of the VLDB Endowment 17, no. 11 (2024): 3045–57. http://dx.doi.org/10.14778/3681954.3681982.

Full text
Abstract:
Although clustering methods have shown promising performance in various applications, they cannot effectively handle incomplete data. Existing studies often impute missing values first before clustering analysis and conduct these two processes separately. However, inaccurate imputation does not necessarily contribute positively to the subsequent clustering. Intuitively, accurate imputation and clustering can serve and benefit from each other, where clustering-based imputation methods typically utilize cluster signals to impute incomplete data and accurate fillings are expected to bring more va
APA, Harvard, Vancouver, ISO, and other styles
33

Gubán, Miklós, Ákos Gubán, József Udvaros, and Ágnes Sándor. "Mathematical Model and A Solution Method of the Establishment of Logistics Centres." International Journal of Advanced Natural Sciences and Engineering Researches 7, no. 4 (2023): 241–45. http://dx.doi.org/10.59287/ijanser.707.

Full text
Abstract:
In this article, I will give an integer non-linear programming model of the first phase of the three-phase method. The objective function of this model has got an indefinite quadratic form. This problem has not got any exact algorithm. But the variables of the model are special, as these are integer variables, and their values are 0 or 1. If we substitute these variables with new special variables, and change some conditions, the new model will be linear integer programming model. The components of the original objective function are rational numbers (these components are cost components), so
APA, Harvard, Vancouver, ISO, and other styles
34

Adebayo, Adedugba, Ogunnaike Olaleke, Kingsley Adeyemo, and Busola Kehinde. "Material Handling and Product Optimality of an Educational Institution Bakery Using Integer Programming." International Journal of Business Strategy and Automation 2, no. 3 (2021): 53–61. http://dx.doi.org/10.4018/ijbsa.20210701.oa4.

Full text
Abstract:
This study presents a numerical analysis for enhancing material handling allotment and deciding whether to produce or not in a bread production section of an educational institution. The study utilized 0/1 and real variables by the means of integer linear programming. In line with this, integer linear programming was applied in a bread production plant that produces three brands of bread, such as, medium size (x1), huge size (x2), and small size (x3). The discoveries using 0/1 variable shows that x1 = x2 = x3 = 1 while Z = 80 Naira. Hence, the item mix of bread is optimal, and production can c
APA, Harvard, Vancouver, ISO, and other styles
35

Hsieh, Yi-Chih. "A two-phase linear programming approach for redundancy allocation problems." Yugoslav Journal of Operations Research 12, no. 2 (2002): 227–36. http://dx.doi.org/10.2298/yjor0202227h.

Full text
Abstract:
Provision of redundant components in parallel is an efficient way to increase the system reliability, however, the weight, volume and cost of the system will increase simultaneously. This paper proposes a new two-phase linear programming approach for solving the nonlinear redundancy allocation problems subject to multiple linear constraints. The first phase is used to approximately allocate the resource by using a general linear programming, while the second phase is used to re-allocate the slacks of resource by using a 0-1 integer linear programming. Numerical results demonstrate the effectiv
APA, Harvard, Vancouver, ISO, and other styles
36

Saraswathi, Meera, K. N. Meera, and Yuqing Lin. "Radio Mean Labeling Algorithm, Its Complexity and Existence Results." Mathematics 13, no. 13 (2025): 2057. https://doi.org/10.3390/math13132057.

Full text
Abstract:
Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio mean labeling. The minimum span of all feasible radio mean labelings of G is the radio mean number of G, denoted by rmn(G). In our previous study, we proved that if G has order n, then rmn(G)∈[n,rmn(Pn)] where Pn is a path of order n. All graphs of diameters 1, 2 and 3 have the radio mean number equal to order n. However, they are not the only
APA, Harvard, Vancouver, ISO, and other styles
37

Kodama, Akito, and Tatsushi Nishi. "Petri net representation and reachability analysis of 0–1 integer linear programming problems." Information Sciences 400-401 (August 2017): 157–72. http://dx.doi.org/10.1016/j.ins.2017.03.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Marinescu, Radu, and Rina Dechter. "Evaluating the impact of AND/OR search on 0-1 integer linear programming." Constraints 15, no. 1 (2009): 29–63. http://dx.doi.org/10.1007/s10601-009-9070-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Arbib, Claudio, Mara Servilio, and Paolo Ventura. "An improved integer linear programming formulation for the closest 0-1 string problem." Computers & Operations Research 80 (April 2017): 94–100. http://dx.doi.org/10.1016/j.cor.2016.11.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Gocht, Stephan, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, and Yong Kiam Tan. "End-to-End Verification for Subgraph Solving." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 8 (2024): 8038–47. http://dx.doi.org/10.1609/aaai.v38i8.28642.

Full text
Abstract:
Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness. Recently, some state-of-the-art subgraph solvers have been enhanced to output machine-verifiable proofs that their results are correct. While this significantly improves reliability, it is not a fully satisfactory solution, since end-users have to trust both the proof checking algorithms and the translation of the high-level graph problem into a low-level 0-1 integer linear program (ILP) used for the proofs. In this work, we
APA, Harvard, Vancouver, ISO, and other styles
41

Wang, Jin, Liang Zhou, and Li Tian. "ILP-based multiperiod flow routing and scheduling method in time-sensitive network." Journal of Physics: Conference Series 2384, no. 1 (2022): 012032. http://dx.doi.org/10.1088/1742-6596/2384/1/012032.

Full text
Abstract:
Abstract Time-sensitive network (TSN) provides end-to-end data transfer with very low latency and high reliability on the basis of Ethernet. It is suitable for time-sensitive applications and will be widely used in scenarios such as autonomous driving and industrial Internet. When the existing time-sensitive flow routing and scheduling methods do not consider the shared bandwidth of the flow triggered by different cycle times, the possibility of conflict is different, which leads to the inaccuracy of the index to measure the scheduling bottleneck. This paper analyses the different cycle time-s
APA, Harvard, Vancouver, ISO, and other styles
42

Monfroglio, Angelo. "Polynomial Time Linear Programs for Hard Constraint Satisfaction Problems." Asian Research Journal of Mathematics 20, no. 8 (2024): 1–18. http://dx.doi.org/10.9734/arjom/2024/v20i8813.

Full text
Abstract:
A recent result shows that a LP model with 0/1 values is of polynomial complexity. The paper reports a model for some important NP hard problems, such as the Propositional Satisfiability Problem, the Traveling Salesperson Problem, and the Minimal Set Covering Problem, by means of only two types of constraints: 'choice constraints'and 'exclusion constraints'. The article presents a linear 0/1 Simplex for solving the obtained integer program. This algorithm always finds a 0-1 integer solution that corresponds to a solution of the Constraint Satisfaction Problem and vice versa. The paper presents
APA, Harvard, Vancouver, ISO, and other styles
43

GARCIA, JORDI, EDUARD AYGUADÉ, and JESÚS LABARTA. "USING A 0–1 INTEGER PROGRAMMING MODEL FOR AUTOMATIC STATIC DATA DISTRIBUTION." Parallel Processing Letters 06, no. 01 (1996): 159–71. http://dx.doi.org/10.1142/s0129626496000169.

Full text
Abstract:
This paper describes an automatic data distribution method which deal with both the alignment and the distribution problems in a single optimization phase, as opposed to sequentially solving these two inter-dependent approaches as done by previous work. The core of this work is called the Communication-Parallelism Graph, which describes the relationships among array dimensions of the same and different array references regarding communication and parallelism. The overall data distribution problem is then formulated as a linear 0–1 integer programming problem, where the objective function to be
APA, Harvard, Vancouver, ISO, and other styles
44

Evans, Gerald W., and Robert Fairbairn. "Selection and Scheduling of Advanced Missions for NASA Using 0-1 Integer Linear Programming." Journal of the Operational Research Society 40, no. 11 (1989): 971. http://dx.doi.org/10.2307/2583133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Evans, Gerald W., and Robert Fairbairn. "Selection and Scheduling of Advanced Missions for NASA Using 0-1 Integer Linear Programming." Journal of the Operational Research Society 40, no. 11 (1989): 971–81. http://dx.doi.org/10.1057/jors.1989.170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Sergienko, I. V., and V. P. Shilo. "Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms." Cybernetics and Systems Analysis 30, no. 2 (1994): 283–91. http://dx.doi.org/10.1007/bf02366431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Sergienko, I. V., and V. P. Shilo. "Investigation of solutions of randomly generated integer linear programming problems with 0–1 variables." Cybernetics and Systems Analysis 32, no. 1 (1996): 50–57. http://dx.doi.org/10.1007/bf02366581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Jost, V., and D. Savourey. "A 0–1 integer linear programming approach to schedule outages of nuclear power plants." Journal of Scheduling 16, no. 6 (2013): 551–66. http://dx.doi.org/10.1007/s10951-013-0322-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Mitsos, Alexander, and Paul I. Barton. "Parametric mixed-integer 0–1 linear programming: The general case for a single parameter." European Journal of Operational Research 194, no. 3 (2009): 663–86. http://dx.doi.org/10.1016/j.ejor.2008.01.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Evans, Gerald W., and Robert Fairbairn. "Selection and Scheduling of Advanced Missions for NASA Using 0–1 Integer Linear Programming." Journal of the Operational Research Society 40, no. 11 (1989): 971–81. http://dx.doi.org/10.1057/palgrave.jors.0401104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!