https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Zerovnik_2015a 2026-04-21T18:43:52Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Zerovnik_2015a&diff=187603&oldid=prev 2021-01-25T18:17:32Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_475943604" class="mw-redirect" title="Draft Content 475943604">Draft Content 475943604</a> to <a href="/public/Zerovnik_2015a" title="Zerovnik 2015a">Zerovnik 2015a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 18:17, 25 January 2021</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Scipediacontent https://www.scipedia.com/wd/index.php?title=Zerovnik_2015a&diff=187602&oldid=prev 2021-01-25T18:17:28Z

<p>Created page with &quot; == Abstract == &lt;jats:p&gt; We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computational...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> &lt;jats:p&gt; We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.<br /> <br /> Document type: Article<br /> <br /> == Full document ==<br /> &lt;pdf&gt;Media:Draft_Content_475943604-beopen1179-4210-document.pdf&lt;/pdf&gt;<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [https://content.sciendo.com/downloadpdf/journals/jlst/6/1/article-p1.pdf https://content.sciendo.com/downloadpdf/journals/jlst/6/1/article-p1.pdf] under the license https://creativecommons.org/licenses/by-nc-nd<br /> <br /> * [http://content.sciendo.com/view/journals/jlst/6/1/article-p1.xml http://content.sciendo.com/view/journals/jlst/6/1/article-p1.xml],<br /> : [https://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.pdf https://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.pdf],<br /> : [http://dx.doi.org/10.1515/jlst-2015-0006 http://dx.doi.org/10.1515/jlst-2015-0006] under the license cc-by-nc-nd<br /> <br /> * [http://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml?format=INT http://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml?format=INT],<br /> : [https://doaj.org/toc/2232-4968 https://doaj.org/toc/2232-4968] under the license http://creativecommons.org/licenses/by-nc-nd/4.0<br /> <br /> * [https://content.sciendo.com/view/journals/jlst/6/1/article-p1.xml?language=en https://content.sciendo.com/view/journals/jlst/6/1/article-p1.xml?language=en],<br /> : [https://www.degruyter.com/downloadpdf/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml https://www.degruyter.com/downloadpdf/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml],<br /> : [https://dk.um.si/IzpisGradiva.php?id=69004 https://dk.um.si/IzpisGradiva.php?id=69004],<br /> : [http://iclst.fl.uni-mb.si/pdf/2014/Zerovnik_Heuristics%20for%20NP-hard%20optimization%20problems%20.pdf http://iclst.fl.uni-mb.si/pdf/2014/Zerovnik_Heuristics%20for%20NP-hard%20optimization%20problems%20.pdf],<br /> : [https://ideas.repec.org/a/vrs/losutr/v6y2015i1p1-10n1.html https://ideas.repec.org/a/vrs/losutr/v6y2015i1p1-10n1.html],<br /> : [https://trid.trb.org/view/1396153 https://trid.trb.org/view/1396153],<br /> : [https://www.growkudos.com/publications/10.1515%252Fjlst-2015-0006 https://www.growkudos.com/publications/10.1515%252Fjlst-2015-0006],<br /> : [https://econpapers.repec.org/article/vrslosutr/v_3a6_3ay_3a2015_3ai_3a1_3ap_3a1-10_3an_3a1.htm https://econpapers.repec.org/article/vrslosutr/v_3a6_3ay_3a2015_3ai_3a1_3ap_3a1-10_3an_3a1.htm],<br /> : [https://socionet.ru/publication.xml?h=repec:vrs:losutr:v:6:y:2015:i:1:p:1-10:n:1 https://socionet.ru/publication.xml?h=repec:vrs:losutr:v:6:y:2015:i:1:p:1-10:n:1],<br /> : [https://core.ac.uk/display/88594658 https://core.ac.uk/display/88594658],<br /> : [https://academic.microsoft.com/#/detail/2282282339 https://academic.microsoft.com/#/detail/2282282339]<br /> <br /> * [https://dk.um.si/IzpisGradiva.php?id=69004 https://dk.um.si/IzpisGradiva.php?id=69004],<br /> : [https://dk.um.si/Dokument.php?id=120357&amp;dn= https://dk.um.si/Dokument.php?id=120357&amp;dn=],<br /> : [https://dk.um.si/Dokument.php?id=120356&amp;dn= https://dk.um.si/Dokument.php?id=120356&amp;dn=],<br /> : [https://plus.si.cobiss.net/opac7/bib/14386203?lang=sl https://plus.si.cobiss.net/opac7/bib/14386203?lang=sl]<br /> <br /> under the license http://creativecommons.org/licenses/by-nc-nd/4.0/</div>

Scipediacontent