Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

34 results for “Assignment Problem”
Set a search alert
Research ArticleOpen accessPhrase in the titleOptimal Components Assignment Problem for Stochastic-Flow NetworksAbdellah Aissou, Abdelhamid Daamouche, Moatamad Refaat HassanComponents assignment problem to maximize the network reliability in the case of each component has both an assignment cost and lead-time is never discussed. Therefore, this paper focuses on solving this problem under the above mentioned constraints. The presented problem is called an Optimal Components Assignment Problem (OCAP) and it is formulated based on three constraints namely total assignment cost, … …Journal of Computer Science, Vol. 15, Issue 1 · 10 Jan 2019 · 7,538 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleApplication of a New Network-enabled Solver for the Assignment Problem in Computer-aided EducationAndreou Dimitrios, Paparrizos Konstantinos, Samaras Nikolaos, Sifaleras AngeloThis study present a new learning tool developed for the visualization of an algorithm for the assignment problem. We show how the teaching of an algorithm can be greatly enhanced and the tutor's effort decreased with a visualization tool that provides an interactive and animated view of the subject being taught to the students. This tool makes use of the … …Journal of Computer Science, Vol. 1, Issue 1 · 31 Mar 2005 · 6,817 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleSolving the State Assignment Problem Using Stochastic Search Aided with Simulated AnnealingWalid M. AlyProblem statement: Solving the state assignment problem means finding the optimum assignment for each state within a sequential digital circuit. These optimum assignments will result in decreasing the hardware realization cost and increasing the reliability of the digital circuit. Unfortunately, the state assignment problem belongs to the class of nondeterministic polynomial time problems (NP complete) which requires heavy computations. Different … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 6,966 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleBenders' 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 PDFCite
Research ArticleOpen accessEvery word in the titleOn the Problem of Stratigraphic Assignment of the Key Seismic Horizons on the East-Arctic Shelf and in the Area of Central Arctic UpliftsLidia Daragan-Sushchova, Lyudmila Grinko, Natalia Petrovskaya, Yuri Daragan-SushchovModern geological and geophysical studies of Central Arctic uplifts area and East-Arctic Shelf has revealed the basic problems in stratigraphic subdivision of sedimentary cover. Basic approach for subdivision of Arctic Ocean sedimentary cover is based on the wave field's characteristics and tracing of regional seismic horizons. Their age identification still depends on general geological ideas. Different correlative models of seismic-stratigraphic … …Current Research in Geoscience, Vol. 5, Issue 1 · 16 Jul 2015 · 7,993 accessesView PDFCite
Research ArticleOpen accessIn the keywordsLayout 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 PDFCite
Research ArticleOpen accessIn the keywordsPartial Eigenvalue Assignment for High-Order Linear Systems in a Time Delayed SystemEhab A. El-Sayed, Eid E. El BehadyThis paper introduces a solution to the partial eigenvalues assignment problem of high order linear systems with time delayed system in both single-input and multi-input cases using orthogonality relations between eigenvectors of the matrix polynomial. The solution requires the knowledge of only a few eigenvalues and with corresponding left eigenvectors of matrix polynomial. The numerical examples are done to illustrate … …American Journal of Applied Sciences, Vol. 13, Issue 9 · 29 Sep 2016 · 7,003 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Best Candidates Method for Solving Optimization ProblemsHlayel Abdallah AhmadProblem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 8,341 accessesView PDFCite