Filters








170,069 Hits in 11.7 sec

Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

Robert M. Nauss
<span title="">2003</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ko3yoz32wja7tmqwbgqqjmfyxa" style="color: black;">INFORMS journal on computing</a> </i> &nbsp;
Due to the difficulty in solving "hard" GAPs to optimality, most recent papers either describe heuristic methods for generating "good" solutions or, in the case of optimizing methods, computational results  ...  T he classical generalized assignment problem (GAP) may be stated as finding a minimum-cost assignment of tasks to agents such that each task is assigned to exactly one agent and such that each agent's  ...  Acknowledgments The author thanks Manuel Laguna for supplying a copy of his code for use in the computational experiments, John Beasley for making available some of the test problems, and the anonymous  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ijoc.15.3.249.16075">doi:10.1287/ijoc.15.3.249.16075</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iubxrdtb5bcdbcsa5rjgchl7ve">fatcat:iubxrdtb5bcdbcsa5rjgchl7ve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100524215613/http://www.cse.iitb.ac.in:80/~adith/talks/LearningMatchings/BTP%20References/249.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/75/38/753865e3b83af266eca9df0b299d711f71637609.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ijoc.15.3.249.16075"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Solving the Generalized Machine Assignment Problem in Group Technology

Chun Hung Cheng, Chon-Huat Goh, Anita Lee
<span title="">1996</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fq4jrflj6zesjk7f4nb4otuwwy" style="color: black;">Journal of the Operational Research Society</a> </i> &nbsp;
The first is an A*-based approach that generates optimal solutions. The second is a heuristic approach developed to solve problems with large number of machines and/or parts.  ...  Cheng et al—Solving the Generalized Machine Assignment Problem 799 The optimal approach The proposed optimal approach uses the A* algorithm?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.1996.99">doi:10.1057/jors.1996.99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bfklrp5jyfdzzk6tktjm2r6xii">fatcat:bfklrp5jyfdzzk6tktjm2r6xii</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_journal-of-the-operational-research-society_1996-06_47_6/page/794" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_journal-of-the-operational-research-society_1996-06_47_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.1996.99"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Solving the Generalized Machine Assignment Problem in Group Technology

Chun Hung Cheng, Chon-Huat Goh, Anita Lee
<span title="">1996</span> <i title="JSTOR"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fq4jrflj6zesjk7f4nb4otuwwy" style="color: black;">Journal of the Operational Research Society</a> </i> &nbsp;
The first is an A*-based approach that generates optimal solutions. The second is a heuristic approach developed to solve problems with large number of machines and/or parts.  ...  Then we formulate the GT machine assignment problem. The optimal and heuristic approaches are pro- posed. The computational experience of the proposed approaches is reported.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/3010287">doi:10.2307/3010287</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/njbspejfx5atfn4forlewz7bwi">fatcat:njbspejfx5atfn4forlewz7bwi</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_journal-of-the-operational-research-society_1996-06_47_6/page/794" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_journal-of-the-operational-research-society_1996-06_47_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2307/3010287"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> jstor.org </button> </a>

Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem [article]

Yijiang Li, John-Paul Clarke, Santanu Dey
<span title="2021-05-05">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we provide a column generation-based approach for solving the airport flight-to-gate assignment problem, where the goal is to minimize the on-ground portion of arrival delays by optimally  ...  Specifically, we use a set covering formulation for the master problem and decompose the pricing problem such that each gate is the basis for an independent pricing problem to be solved for assignment  ...  Concluding remarks We use a column generation approach to solve the flight-to-gate assignment problem aimed at minimizing the total arrival delays.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.05894v3">arXiv:2011.05894v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qgmckorynzfbrdv5cwewzdsibq">fatcat:qgmckorynzfbrdv5cwewzdsibq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210508053126/https://arxiv.org/pdf/2011.05894v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1d/1c/1d1cbc409bff36ad77689fdc6e68cfabc83fba53.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.05894v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem

Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hrz75ifnhbfxfmov3zw4lgfyvu" style="color: black;">2014 IEEE International Conference on Automation Science and Engineering (CASE)</a> </i> &nbsp;
The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem  ...  This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP).  ...  ACKNOWLEDGMENT This research is supported by Singapore National Research Foundation under its International Research Centre @ Singapore Funding Initiative and administered by the IDM Programme Office,  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/coase.2014.6899314">doi:10.1109/coase.2014.6899314</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/case/GunawanNPL14.html">dblp:conf/case/GunawanNPL14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kucpzvznjzg6tbkzq3dunhwqsy">fatcat:kucpzvznjzg6tbkzq3dunhwqsy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321203953/https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=3668&amp;context=sis_research" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/ea/25ea3b7c41daa25f40ee1f82882d724b2eaccf9c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/coase.2014.6899314"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An agent-based hyper-heuristic approach to combinatorial optimization problems

Richard Malek
<span title="">2010</span> <i title="IEEE"> 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems </i> &nbsp;
This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various meta-heuristic algorithms simultaneously.  ...  By the collaboration of various meta-heuristics, we can achieve better results in more classes of problems.  ...  Approach Background Different Meta-Heuristics, Different Points of View Different meta-heuristics have different inner representations of the problem they solve and objective functions (functions assigning  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icicisys.2010.5658624">doi:10.1109/icicisys.2010.5658624</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6mp5pqd6x5dpvenoasrq2om4su">fatcat:6mp5pqd6x5dpvenoasrq2om4su</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808115642/http://www.seage.org/web/data/malek10hyper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/88/0d887b79440601dd3283324d65c684f8f09a21e7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icicisys.2010.5658624"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Solving the Integrated Schedule Generation and Fleet Assignment Problem: an ACOBased Metaheuristic Approach

Daniel J. Caetano, Nicolau D. F. Gualda
<span title="">2015</span> <i title="FapUNIFESP (SciELO)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rpjchvjyyra7bba54nwf5ow7fu" style="color: black;">Journal of Transport Literature</a> </i> &nbsp;
Article Info Abstract Keywords: air transportation schedule generation fleet assignment metaheuristic ant system Traditionally, the initial steps on airline planning -Schedule Generation and Fleet Assignment  ...  This article presents a linear programming formulation of this integrated problem along with a heuristic approach, called MAGS, based on the ACO metaheuristic.  ...  This paper presents both an exact LP model (Caetano and Gualda, 2011) and a new heuristic model that incorporates the Ant Colony Optimization metaheuristic to solve SGP and FAP as an integrated problem  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1590/2238-1031.jtl.v9n3a6">doi:10.1590/2238-1031.jtl.v9n3a6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ojh7qmkgn5dnpfecga5xjf5v3u">fatcat:ojh7qmkgn5dnpfecga5xjf5v3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725165553/http://www.scielo.br/pdf/jtl/v9n3/2238-1031-jtl-09-03-0030.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/06/3406f10cd64a077c644576b1b4276032d669d835.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1590/2238-1031.jtl.v9n3a6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> scielo.br </button> </a>

A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem

Johann Hartleb, Marie Schmidt, Christos D. Zaroliagis, Dennis Huisman
<span title="2020-11-10">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cwlyu7p66nbrzna5rkunsyazti" style="color: black;">Algorithmic Approaches for Transportation Modeling, Optimization, and Systems</a> </i> &nbsp;
into smaller subproblems and solve them independently to optimality.  ...  We prove that composing the solutions of the subproblems yields an optimal solution to the whole problem if the overlap of the horizons is sufficiently large.  ...  However, the underlying theory of the solution approach is more general. The vehicle scheduling problem V S is modeled as a general network flow problem on a directed cycle-free graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/oasics.atmos.2020.15">doi:10.4230/oasics.atmos.2020.15</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/atmos/HartlebS20.html">dblp:conf/atmos/HartlebS20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h2lofnjxpnejpmws3mm6yjmikq">fatcat:h2lofnjxpnejpmws3mm6yjmikq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201213193845/https://drops.dagstuhl.de/opus/volltexte/2020/13151/pdf/OASIcs-ATMOS-2020-15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/06/a8/06a859916280ee2fb846a3ad6cd679b835274c2f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/oasics.atmos.2020.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A transportation branch and bound algorithm for solving the generalized assignment problem

Elias Munapo, 'Maseka Lesaoana, Philimon Nyamugure, Santosh Kumar
<span title="2015-02-11">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kzctxbvrwvbefnl5krvhhznpru" style="color: black;">International Journal of Systems Assurance Engineering and Management</a> </i> &nbsp;
This paper presents a transportation branch and bound algorithm for solving the generalized assignment problem.  ...  This is a branch and bound technique in which the sub-problems are solved by the available efficient transportation techniques rather than the usual simplex based approaches.  ...  Note that: Nauss (2003) presented both a heuristic and an optimizing approach. In this paper we propose a transportation branch and bound algorithm for solving the generalized assignment problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13198-015-0343-9">doi:10.1007/s13198-015-0343-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/65nfxxs7xfbmboebykssm3ugju">fatcat:65nfxxs7xfbmboebykssm3ugju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809122342/http://orlabanalytics.ca/lnms/archive/v6/lnmsv6p150.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/de/f3de959d884be80405981850de200c67d5e3c6d4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13198-015-0343-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Optimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation Problem

Sirirat Wongprakor, Peerayuth Charnsethi
<span title="2007-03-01">2007</span> <i title="Science Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2lsiqmywajba3cmrphqr452nfu" style="color: black;">Journal of Mathematics and Statistics</a> </i> &nbsp;
Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches  ...  The results indicated that the approach based on the column-generation technique with the proposed heuristic method is the most efficient method for solving this studied large-scale problems.  ...  Benders decomposition approach is a quick approach and an effective approach for modeling and solving the problems using resource-directive based approaches [6] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jmssp.2007.142.150">doi:10.3844/jmssp.2007.142.150</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ikyaecqbzrdubix42342hx62je">fatcat:ikyaecqbzrdubix42342hx62je</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814200152/http://thescipub.com/PDF/jmssp.2007.142.150.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/09/e6/09e619754dde4d639d58ce165a81d2280a9c509f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jmssp.2007.142.150"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

An exact method with variable fixing for solving the generalized assignment problem

Marius Posta, Jacques A. Ferland, Philippe Michelon
<span title="2011-09-13">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jkj6zja2ubhybmybu4bm5sgkwe" style="color: black;">Computational optimization and applications</a> </i> &nbsp;
We propose a simple and very effective algorithm for solving the generalized assignment problem exactly.  ...  Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we solve these effectively using variable-fixing rules.  ...  Acknowledgements We wish to thank the associate editor and the anonymous referee of the journal to which we submitted this paper, their comments and suggestions helped to improve its clarity.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10589-011-9432-0">doi:10.1007/s10589-011-9432-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6tvqulalbndufo3iqrhyez3wxa">fatcat:6tvqulalbndufo3iqrhyez3wxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808115358/https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2011-17.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/11/1011d1a171d5b6987bec8a0dc72c99d0b7fe7d07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10589-011-9432-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Solving a Special Case of the Generalized Assignment Problem Using the Modified Differential Evolution Algorithms: A Case Study in Sugarcane Harvesting

Tassin Srivarapongse, Phajongjit Pijitbanjong
<span title="2019-01-30">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vhnu6ujxobdrvc3gvs5uxfpr64" style="color: black;">Journal of Open Innovation: Technology, Market and Complexity</a> </i> &nbsp;
We proposed and created a methodology to solve a real-world problem, which is a special case of the generalized assignment problem.  ...  We developed a mathematical model to reflect this problem and to solve it to find the maximum outcome using Lingo v.11 commercial optimization software.  ...  such as the heuristics approximation method [20] and the approximation approach to adapt the knapsack solving method [21] , heuristics, where it is the combination of the exact method and heuristics  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/joitmc5010005">doi:10.3390/joitmc5010005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zpp4fysnzvht5edj3lm3gydcaq">fatcat:zpp4fysnzvht5edj3lm3gydcaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427163441/https://res.mdpi.com/JOItmC/JOItmC-05-00005/article_deploy/JOItmC-05-00005.pdf?filename=&amp;attachment=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/f4/54f4fc231638a7ea5ac50e414b391ebe1f44900c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/joitmc5010005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Layout Optimization in a Fitness Industry: An Application of QAP Formulation and Heuristic Approaches

İbrahim Miraç Eligüzel, Eren Özceylan, Yakup Atasagun
<span title="2021-04-01">2021</span> <i title="Science Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wake4w3hqzd4ndiy2zowpciv64" style="color: black;">Journal of Computer Science</a> </i> &nbsp;
The 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 results show that the heuristic approaches are more effective than IP in terms of computational time.  ...  Acknowledgment The authors would like to sincerely thank and acknowledge the guidance of the anonymous reviewers of the journal.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jcssp.2021.440.450">doi:10.3844/jcssp.2021.440.450</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fsdhbq53hje6dcsxv347l3beq4">fatcat:fsdhbq53hje6dcsxv347l3beq4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210521060508/https://thescipub.com/pdf/jcssp.2021.440.450.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/95/e8/95e8b267cbc1ab75882fa629d98af1295b945d1e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3844/jcssp.2021.440.450"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An Intelligent Channel Estimation Approach for MIMO-OFDM Systems using Meta-heuristic Optimization Algorithm

K. Vidhya, K.R. Shankar Kumar
<span title="2014-05-15">2014</span> <i title="Maxwell Scientific Publication Corp."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/itifugluyrhulokjxf64yqrfey" style="color: black;">Research Journal of Applied Sciences Engineering and Technology</a> </i> &nbsp;
This research study mainly focuses to develop an efficient channel estimation approach through swarm intelligence approach with lesser computational complexity.  ...  Least Square (LS) and Minimum Mean Square Error (MMSE) approaches are the most commonly used channel estimation techniques.  ...  Initially, LS and MMSE channel model is calculated an efficient Meta heuristic approach called Improved PSO is applied in LS and MMSE channels.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.19026/rjaset.7.770">doi:10.19026/rjaset.7.770</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3lavaxynnzdtzjnfte4faj2ngu">fatcat:3lavaxynnzdtzjnfte4faj2ngu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809105238/http://maxwellsci.com/print/rjaset/v7-4079-4087.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6b/86/6b86dbb07d7852dbe7cb77d4606149ffc7c58c4e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.19026/rjaset.7.770"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Comparing phylogenetics and linear morphometrics to solve the generic assignment of Parabolinella? triarthroides Harrington (Trilobita, Olenidae)

Daniela S. Monti, Viviana A. Confalonieri
<span title="2017-08-18">2017</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5hwqhdci5vhrhovl42k42s6v2u" style="color: black;">Journal of Paleontology</a> </i> &nbsp;
) is the implementation of an integrative approach, combining different methodological techniques and a good description of specimens.  ...  To explore the generic assignment of this species, a revision of the type material, plus a morphometric analysis including specimens of Parabolinella Brøgger, 1882 and Bienvillia were performed.  ...  Esteve, an anonymous reviewer, and the editors, B. Hunda and N. Hughes, for improving the quality of the work. Finally we acknowledge CONICET and Universidad de Buenos Aires for financial support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/jpa.2017.60">doi:10.1017/jpa.2017.60</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vb6vsgsxefb25nmwo32xjzlsby">fatcat:vb6vsgsxefb25nmwo32xjzlsby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030100256/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8B01E05A146984FDD9388476963D6D46/S0022336017000609a.pdf/div-class-title-comparing-phylogenetics-and-linear-morphometrics-to-solve-the-generic-assignment-of-span-class-italic-parabolinella-span-span-class-italic-triarthroides-span-harrington-trilobita-olenidae-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b9/1d/b91d1cec57e7f16973bcaf1e224a322383c65f2a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/jpa.2017.60"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 170,069 results