11:4411:44, 26 April 2022diffhist+897
N
Draft:Fixed set search
←Created page with '{{User sandbox}} <!-- EDIT BELOW THIS LINE --> The fixed set search (FSS) is a novel metaheuristic that has previously been successfully applied to solve the traveling salesman problem \citep{jovanovic2019fixedTSP}, the power dominating set problem \citep{jovanovic2020fixedPDSP}, machine scheduling \citep{jovanovic2020fixedMSP} and the minimum weighted vertex cover problem \citep{jovanovic2019fixedMWVCP}. In addition, it has proven suitable for solving bi...'
10:4210:42, 26 April 2022diffhist+141
N
User:Rakabog
←Created page with '* <code>Fixed set search</code> with the article name you wish to create. : <code><nowiki>{{UserboxCOI|1=Fixed set search}}</nowiki></code>'Tag: Visual edit
11:4411:44, 26 April 2022diffhist+897
N
Draft:Fixed set search
←Created page with '{{User sandbox}} <!-- EDIT BELOW THIS LINE --> The fixed set search (FSS) is a novel metaheuristic that has previously been successfully applied to solve the traveling salesman problem \citep{jovanovic2019fixedTSP}, the power dominating set problem \citep{jovanovic2020fixedPDSP}, machine scheduling \citep{jovanovic2020fixedMSP} and the minimum weighted vertex cover problem \citep{jovanovic2019fixedMWVCP}. In addition, it has proven suitable for solving bi...'
10:4210:42, 26 April 2022diffhist+141
N
User:Rakabog
←Created page with '* <code>Fixed set search</code> with the article name you wish to create. : <code><nowiki>{{UserboxCOI|1=Fixed set search}}</nowiki></code>'Tag: Visual edit