Results 21 to 30 of about 36,809 (204)
Discrete Optimization: The Case of Generalized BCC Lattice
Mathematics, 2021 Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance.
Gergely Kovács +4 more
doaj +1 more source
New Hybrid Cutting Plane Method For Solving Integer Linear Programming Problems [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2011 This work deals with a new method for solving Integer Linear Programming Problems depending on a previous methods for solving these problems such that Branch and Bound method and Cutting Planes method where this new method is a combination between them ...
Abbas Al-Bayati, Nawar Abdullah
doaj +1 more source
A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem
Discrete Dynamics in Nature and Society, 2016 A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem.
Huizhi Ren, Shenshen Sun
doaj +1 more source
A New Algorithms in Mixed Integer Programming Problems [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 In this paper we have studied two new algorithms for solving mixed IPP. In the 1st algorithm we have investigated a new short technique for searching to the efficient cut in the standard cutting plane procedure to obtain the same optimal solution by ...
Basim Hassan, Abbas Al-Bayati
doaj +1 more source
Exact solution approaches for the workload smoothing in assembly lines
Engineering Science and Technology, an International Journal, 2021 In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer
Derya Dinler, Mustafa Kemal Tural
doaj +1 more source
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model
Operations Research Perspectives, 2017 In this paper we describe the automatic instantiation of a Variable Neighborhood Descent procedure from a Mixed Integer Programming model. We extend a recent approach in which a single neighborhood structure is automatically designed from a Mixed Integer
Tommaso Adamo +3 more
doaj +1 more source
Accelerated non-negative tensor completion via integer programming
Frontiers in Applied Mathematics and Statistics, 2023 The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require exponentially more ...
Wenhao Pan +3 more
doaj +1 more source
Discrete Mathematics, 1972 Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values ...
openaire +2 more sources
Integer programming model for distance-edge-monitoring problem [PDF]
Yugoslav Journal of Operations ResearchThe paper considers the recently introduced distance-edge-monitoring problem. For a given graph G = (V,E), the set M is called distance-edge-monitoring if it is a subset of V and for every edge e of E there is a vertex x of M and a vertex y of V such ...
Kartelj Aleksandar +2 more
doaj +1 more source
Mixed-Integer Programming to Solve Distribution Problems
Journal of New Results in Science, 2020 Mixed-integer linear and quadratic programming problems are considered to solve distribution problems in this paper. The first problem is the distribution of proctors with respect to the student placements to the class- rooms by mixed-integer linear ...
Kamil Oruçoğlu +4 more
doaj