3 results for “linear assignment problems”

Set a search alert

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 PDF Cite

Research ArticleOpen accessIn the abstractOR/MS Applications in Mt. Merapi Disaster ManagementAmril Aman, Toni Bakhtiar, Farida Hanum, Prapto Tri SupriyoProblem statement: Much of researches on the management of disaster deal with their social aspects such as sociological and psychological effects on communities. Recently there had been a growing credit of the demand for application of the operational research and management science matters in disaster management. This approach commonly utilizes decision theory, dynamical system and optimization technique to minimize the … …Journal of Mathematics and Statistics, Vol. 8, Issue 2 · 19 Jun 2012 · 7,035 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordBenders' 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