Filters








8,449 Hits in 6.6 sec

Page 2946 of Mathematical Reviews Vol. , Issue 99d [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Mihai Caragiu (1-WAS; Pullman, WA) 99d:94032 94B05 Jaffe, David B. (1-NE; Lincoln, NE) A brief tour of split linear programming.  ...  The main topic of the paper is split linear programming, a generalization of Delsarte’s original linear programming method.”  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-04_99d/page/2946" 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_mathematical-reviews_1991-04_99d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 885 of SMPTE Motion Imaging Journal Vol. 108, Issue 12 [page]

<span title="">1999</span> <i title="Society of Motion Picture and Television"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_smpte-motion-imaging-journal" style="color: black;">SMPTE Motion Imaging Journal </a> </i> &nbsp;
Larsen also showed a tape displaying a split-screen demonstration of the advan- tages of COFDM modulation in mobile and aerial ENG applications Following the meeting WWJ-TV staff gave tours of the facility  ...  Bob Spencer gave a brief description of the Renaissance Center, a state-of-the-art facili- ty designed to provide educational programs and initiatives (actual theater, production, music, and other activities  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_smpte-motion-imaging-journal_1999-12_108_12/page/885" 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_smpte-motion-imaging-journal_1999-12_108_12/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Theory Applied—Experience Tours at the Naval Postgraduate School

Robert Shearer, Lyn Whitaker
<span title="">2012</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7vrucex74zbrxaarrhx2epudwu" style="color: black;">INFORMS Transactions on Education</a> </i> &nbsp;
Halfway through the two year program, each student is encouraged to participate in a three to six week experience tour at a Department of Defense (DoD) analytical organization.  ...  We recognize that the unique set of circumstances here at NPS makes this all possible but hold strongly to the idea that applied experience is essential to our graduates and that aspects of our program  ...  Brown speaks from experience-he taught then Commander Mullen linear programming in 1984.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ited.1120.0094">doi:10.1287/ited.1120.0094</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qmpsfpz4izd4ppyjhmxbrjj3sy">fatcat:qmpsfpz4izd4ppyjhmxbrjj3sy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217040444/https://core.ac.uk/download/pdf/45464284.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/02/03/02030a2f0d262e0da674054da9b9b0822c9df8cb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ited.1120.0094"> <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>

Page 8259 of Mathematical Reviews Vol. , Issue 98M [page]

<span title="">1998</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
For the case of series-parallel posets we solve the optimization problem over and give a linear description of .Y.”  ...  Summary: “The postman problem requires finding a lowest cost tour in a connected graph that traverses each edge at least once.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1998-12_98m/page/8259" 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_mathematical-reviews_1998-12_98m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Bend Minimization in Planar Orthogonal Drawings Using Integer Programming

Petra Mutzel, René Weiskircher
<span title="">2006</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q3xjdl4ok5hbzabogkpxxajhfy" style="color: black;">SIAM Journal on Optimization</a> </i> &nbsp;
Our approach for biconnected graphs combines an integer linear programming (ILP) formulation for the set of all embeddings of a planar graph with the network flow formulation for fixed embeddings.  ...  While the problem can be solved via network flow for a given planar embedding of a graph G, it is NP-hard if we consider the set of all planar embeddings of G.  ...  Acknowledgment We thank Walter Didimo for providing the code of the branch & bound algorithm and the real world benchmark set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/040614086">doi:10.1137/040614086</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q2giaw2mw5gktixad3tczybv7y">fatcat:q2giaw2mw5gktixad3tczybv7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050413125337/http://www.ads.tuwien.ac.at:80/publications/bib/pdf/tr0402.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/83/09/8309349d9ad05553fccf56c5a2875161f09fb428.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/040614086"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 1449 of Mathematical Reviews Vol. , Issue 99b [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Jaffe, A brief tour of split linear programming (164-173); Frédéric Jean and Pierre-Vincent Koseleff, Elementary approximation of expo- nentials of Lie polynomials (174-188); Jorn M.  ...  Jensen, On the q-ary image of cyclic codes (189-196); Tadao Kasami, Tsukasa Sugita and Toru Fujiwara, The split weight (wi, wp) enumera- tion of Reed-Muller codes for wy + wr < 2dmin (197-211); Ivan N.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-02_99b/page/1449" 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_mathematical-reviews_1991-02_99b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

TSP- Infrastructure for the Traveling Salesperson Problem

Michael Hahsler, Kurt Hornik
<span title="">2007</span> <i title="Foundation for Open Access Statistic"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yr3cv2yayvhvdcoj6lb4qw36kq" style="color: black;">Journal of Statistical Software</a> </i> &nbsp;
The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.  ...  The importance of the TSP arises besides from its theoretical appeal from the variety of its applications.  ...  Acknowledgments The authors of this paper want to thank Roger Bivand for providing the code to correctly draw tours and paths on a projected map.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18637/jss.v023.i02">doi:10.18637/jss.v023.i02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v66e5drlarhtvbr3dhf54hjmfi">fatcat:v66e5drlarhtvbr3dhf54hjmfi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810161008/http://dirichlet.mat.puc.cl/web/packages/TSP/vignettes/TSP.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/56/f6/56f622a40b41d4f2a8861fb8be97548412f0a3ee.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18637/jss.v023.i02"> <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>

Optimal coverage of a known arbitrary environment

Raphael Mannadiar, Ioannis Rekleitis
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nytnrt3gtzbixld5r6a4talbky" style="color: black;">2010 IEEE International Conference on Robotics and Automation</a> </i> &nbsp;
The problem of coverage of known space by a mobile robot has many applications.  ...  The optimal solution to the Chinese Postman Problem (CPP) is used to calculate an Euler tour, which guarantees complete coverage of the available free space while minimizing the path of the robot.  ...  ACKNOWLEDGMENT We would like to thank the generous support of Microsoft Research and of the National Research Council of Canada (NSERC) that partially funded this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/robot.2010.5509860">doi:10.1109/robot.2010.5509860</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icra/MannadiarR10.html">dblp:conf/icra/MannadiarR10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5l76lc4ivbgxrp2faoct2xqiim">fatcat:5l76lc4ivbgxrp2faoct2xqiim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130818050314/http://www.cim.mcgill.ca:80/~yiannis/Publications/ICRA_2010.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/ca/08/ca08628c32a8359da961f7a015f6fe873cb73fe3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/robot.2010.5509860"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Static Load-Balancing Techniques for Iterative Computations on Heterogeneous Clusters [chapter]

Hélène Renard, Yves Robert, Frédéric Vivien
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We establish a complexity result that assesses the difficulty of this problem, and we design practical heuristics that provide efficient distribution schemes.  ...  the constraints ensures that the tour does not split into sub-tours.  ...  Conversely, suppose that we have a solution to the ILP problem, and assume that the tour splits into at least two sub-tours.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45209-6_24">doi:10.1007/978-3-540-45209-6_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hqgkdkmauvfqtpaummry7uln3i">fatcat:hqgkdkmauvfqtpaummry7uln3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140828101635/http://hal.inria.fr/docs/00/07/18/42/PDF/RR-4745.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/e7/6c/e76ce0b8c76cac7a68de5335c9eef22800346c4f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45209-6_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

United Airlines Station Manpower Planning System

Thomas J. Holloran, Judson E. Byrn
<span title="">1986</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xov32a3x2netpgib4hww2zh2qm" style="color: black;">Interfaces</a> </i> &nbsp;
It consists of a mixed integer linear programming model (Start Times Module), a continuous linear programming model (Scheduling Module), a heuristic rounding routine and report writer (Report Module),  ...  Beginning with a few computer programs that automated manual scheduling techniques and a simple linear programming model, we developed a Station Manpower Planning System (SMPS) by adding functions and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/inte.16.1.39">doi:10.1287/inte.16.1.39</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ixefjwzzonfrbjtbmjtcqvcuom">fatcat:ixefjwzzonfrbjtbmjtcqvcuom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100611024435/http://www.wright.edu/~xinhui.zhang/EdelmanPrize/Slides/UAStationManpowerPlanning.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/fd/49/fd4975417b8fedf1f2e8bcfa8f985494f3300cbd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/inte.16.1.39"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Traveling Salesman Problem with Hotel Selection: Comparative Study of the Alternative Mathematical Formulations

Cemal Aykut Gencel, Barış Keçeci
<span title="">2019</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sqnbv6uavzg4nagumbc5c6qwmi" style="color: black;">Procedia Manufacturing</a> </i> &nbsp;
Tour scheduling has a central importance in logistics in service-based industries.  ...  Abstract Tour scheduling has a central importance in logistics in service-based industries.  ...  But however for a fixed number of trips, the TSPHS can be formulated as a mixed-integer linear programming (MILP) formulation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.promfg.2020.01.270">doi:10.1016/j.promfg.2020.01.270</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ppxdgti3njaife4lvisqtgsxve">fatcat:ppxdgti3njaife4lvisqtgsxve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200228010454/https://pdf.sciencedirectassets.com/306234/1-s2.0-S2351978920X00035/1-s2.0-S2351978920303346/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEAEaCXVzLWVhc3QtMSJIMEYCIQD78RLPIKXenKw9Ed3ABNksK7m19IobHxDhRy%2FAuFdU%2FgIhANxZRz5FzCW6ZlkfvlCSxvFklpPli2ib23GANyx3TiR5Kr0DCMn%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEQAhoMMDU5MDAzNTQ2ODY1IgzGRu9mdU0ioIgF%2BtoqkQNQ9%2FTNdxScr8uOWe4u4fmwe8ZPqCqn8FXHWrJ5XDDrLWVRVa7eazRybIh%2BO3%2BXr4MzH15%2BMC4MCx4ML%2F3xpB1eR37dPYOtoRZpnKaGAA%2Fzall%2FHIWVvyeYW7XZNUSl6XXuv3fP3m%2FyFCt4uHpBsiZL6ykgGxeg%2FtUBXAAbIuopy3iE9cFp5dMf6agRfhvb7uSmBdSrcdnriRrdg2A20qjZ99P6C8UcBmRm4%2FzP5yfY4MWvlAF2liJ0HLbiQAzsqvBU75xvAZ87uJsLAwWSzqO2JFvdY9e7lzhTNf%2FFtT2ZSEQPenyWpMUEeAlK198YrI9wsJ%2FJCQQQ4Y7UT4AJPiASj6afeY13lz24MyqnIMWWvgyTSMQUMYXqHfdN1O7PAB%2F34w0opOGVp9RtM4oBG5LxfCjBou%2BA8yhpt8SeIF8Iuw1PCtFF47iW3yQGTB9fAIvx%2BFU20W2MXjeffnkiZIdLsDSxgBkEBhYYy%2FnA74b71mtVV92d%2BNROyoF%2BXNK0%2FV2mCY6v9jQkVNMBdfLnzOpJkzCEueHyBTrqAVbDoHzR0Q6coCu4QFzap6HGErXLM2tWFfxmwFGsONmfJXOkGnoKmoJ4kGlj9eYbIqDzjxj%2Fq9I8BsLJgbjgImmk2jII5nDSD%2BaSj%2BPGLfT03CTd%2FbWLoJzA99%2Fve5zbQvI3HYDTNAV593ZqKc%2Bs5eogIv40RieBu4ZlfICNdDJyr0tbFlJdYDM7maBaGHctL037SA8g5RnR2I%2F9n6WNOp%2FuOlxAxhWkLwVgvVvoYpTEaeuFO59NCOPQMlbHw53JuupKUuYjW48Gc%2F60iOGHmALo%2BSNKJ7wDM1msd4vdFD37o6YLlt8REfmsQQ%3D%3D&amp;X-Amz-Algorithm=AWS4-HMAC-SHA256&amp;X-Amz-Date=20200228T010448Z&amp;X-Amz-SignedHeaders=host&amp;X-Amz-Expires=300&amp;X-Amz-Credential=ASIAQ3PHCVTYXZ7ZZBFP%2F20200228%2Fus-east-1%2Fs3%2Faws4_request&amp;X-Amz-Signature=3b3c596ff1d2e24cb57575b911cd9c28e7f65e0afa22654b86edc319199a6677&amp;hash=cdbdb7f433a9c69cfeb456ef86ae4bbeba69b1421d823857ba16f7a61bb04bd5&amp;host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&amp;pii=S2351978920303346&amp;tid=spdf-4361f550-a32f-4fdd-8642-be9034f269fc&amp;sid=b46c8937201a414b0c78eb068461bb5bc1c5gxrqa&amp;type=client" 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] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.promfg.2020.01.270"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Fifty-Plus Years of Combinatorial Integer Programming [chapter]

William Cook
<span title="2009-11-06">2009</span> <i title="Springer Berlin Heidelberg"> 50 Years of Integer Programming 1958-2008 </i> &nbsp;
Throughout the history of integer programming, the field has been guided by research into solution approaches to combinatorial problems.  ...  We discuss some of the highlights and defining moments of this area.  ...  In this paper we give a brief history of combinatorial IP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-68279-0_12">doi:10.1007/978-3-540-68279-0_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dapp75vgxbaa3oy5eyydr2qyly">fatcat:dapp75vgxbaa3oy5eyydr2qyly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922025720/http://www.math.uwaterloo.ca/~bico//papers/ip50.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/6c/60/6c60c990db66e998b08564baa9e71d42e9f03976.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-68279-0_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A PTAS for the Min-Max Euclidean Multiple TSP [article]

Mary Monroe
<span title="2021-12-13">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
is to minimize the maximum tour length.  ...  We analyze the accumulation of error in the DP to prove that the solution is a (1 + ε)-approximation.  ...  Carlsson, et al. apply a combination of linear programming with global improvement and a region partitioning heuristic [CGS+ 07].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.04325v2">arXiv:2112.04325v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u67tvjt6lvhdzoeu6mdfr4aoyi">fatcat:u67tvjt6lvhdzoeu6mdfr4aoyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211216211030/https://arxiv.org/pdf/2112.04325v2.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/74/b7/74b77365292664d6ff2534092b3acb3fd44ee266.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.04325v2" 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>

A Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithm

Yasemin Kocaoglu, Emre Cakmak, Batuhan Kocaoglu, Alev Taskin Gumus
<span title="2020-02-27">2020</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
Managing the distribution of goods is a vital operation for many companies.  ...  In this situation, a mixed delivery system is a good solution for it and allows the use of different strategies together to decrease delivery costs.  ...  Additionally, the authors would like to thank Dogus Teknoloji for their encouraging efforts in the completion of this study.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2020/3943798">doi:10.1155/2020/3943798</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bel3ybb5djb2hnioebuqcpuub4">fatcat:bel3ybb5djb2hnioebuqcpuub4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200306050608/http://downloads.hindawi.com/journals/mpe/2020/3943798.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/2b/62/2b623afe8d956b187206f2227918e4eb78acc32e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2020/3943798"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Ant Colony optimization technique to Solve the min-max multi depot vehicle routing problem

K. S. V. Narasimha, E. Kivelevitch, M. Kumar
<span title="">2012</span> <i title="IEEE"> 2012 American Control Conference (ACC) </i> &nbsp;
This research focuses on solving the min-max Multi Depot Vehicle Routing Problem (MDVRP) based on a swarm intelligence based algorithm called ant colony optimization.  ...  A traditional MDVRP tries to minimize the total distance travelled by all the vehicles to all customer locations. The min-max MDVRP, on the other hand, tries to 2.5.  ...  The first heuristic was a linear programming based load balancing technique.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2012.6315583">doi:10.1109/acc.2012.6315583</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bg6wblzdgjepvmqzlyrtmoigpa">fatcat:bg6wblzdgjepvmqzlyrtmoigpa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426223113/https://etd.ohiolink.edu/!etd.send_file?accession=ucin1324399082&amp;disposition=inline" 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/2e/ac/2eac5453a8b32b376053ac4f95f5874efe2d6f2f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acc.2012.6315583"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 8,449 results