7 results for “Integer Solutions”

Set a search alert

Research ArticleOpen accessIn the keywordsOn The Diophantine Equation xa + ya = pkzbKeng Yarn Wong, Hailiza KamarulhailiIn this study, we consider the Diophantine equation xa + ya = pkzb where p is a prime number, gcd(a, b) = 1 and k,a,b∈Z+. We solve this equation parametrically by considering different cases of x and y and find that there exist infinitely many nontrivial integer solutions, where the formulated parametric solutions solve xa + ya = pkzb completely … …Journal of Mathematics and Statistics, Vol. 13, Issue 1 · 11 Mar 2017 · 7,288 accessesView PDF Cite

Research ArticleOpen accessIn the abstractLayout Optimization in a Fitness Industry: An Application of QAP Formulation and Heuristic Approachesİbrahim Miraç Eligüzel, Eren Özceylan, Yakup AtasagunThe Quadratic Assignment Problem (QAP) is the problem of determining a one-to-one and onto assignment between two sets, each consisting of n objects (e.g., n facilities and n locations) so as to minimize the sum of the distance × flow associated with pairs of assignments. In this study, QAP formulation is applied to a fitness center to assign the sports … …Journal of Computer Science, Vol. 17, Issue 4 · 3 May 2021 · 6,681 accessesView PDF Cite

Research ArticleOpen accessIn the abstractQuantization of Map-Based Neuronal Model for Embedded Simulations of Neurobiological Networks in Real-TimeNikolai F. Rulkov, Ariel Mark Hunt, Peter N. Rulkov, Andrey G. MaksimovThe discreet-time (map-based) approach to modeling nonlinear dynamics of spiking and spiking-bursting activity of neurons has demonstrated its very high efficiency in simulations of neuro-biologically realistic behavior both in large-scale network models for brain activity studies and in real-time operation of Central Pattern Generator network models for biomimetic robotics. This paper studies the next step in improving the model computational … …American Journal of Engineering and Applied Sciences, Vol. 9, Issue 4 · 9 Nov 2016 · 8,775 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSolving the Periodic Maintenance Scheduling Problem via Genetic Algorithm to Balance Workforce Levels and Maintenance CostMohamed Ali Abdel-Fattah MansourProblem statement: In this article we address the multi-objective Periodic Maintenance Scheduling Problem (PMSP) of scheduling a set of cyclic maintenance operations for a given set of machines through a specified planning period to minimize the total variance of workforce levels measured in man-hours and maintenance costs with equal weights. Approach: The article proposed a mixed integer non-linear math programming … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 2 · 12 Jul 2011 · 8,317 accessesView PDF Cite

Research ArticleOpen accessIn the abstractApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly LineA. Norozi, M.K.A. Ariffin, N. IsmailProblem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 1 · 31 Mar 2010 · 9,341 accessesView PDF Cite

Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Discrete Optimization Description for the Solutions in the Matching ProblemWalied H. SharifThis study was concerned with the characterization of solutions in the matching problem. The general mixed-integer programming problem is given together with the definition of the convex hull of the integer solutions. In addition, the matching problem is defined as an integer problem and an algorithm is described to find the optimum matchings. Some illustrative examples are introduced to clarify … …Journal of Mathematics and Statistics, Vol. 2, Issue 1 · 31 Mar 2006 · 6,896 accessesView PDF Cite