| /dports/devel/tcllib/tcllib-1.20/modules/struct/graph/tests/ops/ |
| H A D | metrictsp.test | 2 #Metric Travelling Salesman Algorithm - Tests
51 #Test 1.3 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
64 #Test 1.4 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
77 #Test 1.5 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
86 #Test 1.6 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
95 #Test 1.7 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
108 #Test 1.8 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
121 #Test 1.9 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
134 #Test 1.10 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
147 #Test 1.11 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
|
| H A D | tspheuristics.test | 2 #Tests for heuristics of local searching for Traveling Salesman Problem.
|
| /dports/devel/tcllibc/tcllib-1.20/modules/struct/graph/tests/ops/ |
| H A D | metrictsp.test | 2 #Metric Travelling Salesman Algorithm - Tests
51 #Test 1.3 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
64 #Test 1.4 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
77 #Test 1.5 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
86 #Test 1.6 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
95 #Test 1.7 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
108 #Test 1.8 - testing subprocedure createTGraph used by Metric Travelling Salesman procedure
121 #Test 1.9 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
134 #Test 1.10 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
147 #Test 1.11 - testing subprocedure createCompleteGraph used by Metric Travelling Salesman procedure
|
| H A D | tspheuristics.test | 2 #Tests for heuristics of local searching for Traveling Salesman Problem.
|
| /dports/finance/weberp/webERP/ |
| H A D | PDFSalesBySalesperson.php | 94 $Salesman=''; variable
116 if ($Salesman > '' and $Salesman <> $myrow['salesmanname']){
120 $Salesman = $myrow['salesmanname']; variable
|
| /dports/finance/weberp/webERP/includes/ |
| H A D | PDFAgedDebtorsPageHeader.inc | 19 if (trim($_POST['Salesman'])!=''){
20 $SQL = "SELECT salesmanname FROM salesman WHERE salesmancode='".$_POST['Salesman']."'";
23 …$HeadingLine3 = _('And Has at Least 1 Branch Serviced By Sales Person #'). ' '. $_POST['Salesman']…
|
| /dports/games/scummvm/scummvm-2.5.1/devtools/create_achievements/gen/ |
| H A D | steam-307570.ini | 3 item_0_title=Super Salesman
6 item_1_title=Salesman
27 item_8_title=End of a Salesman
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/doc/ |
| H A D | TSP.md | 1 # Travelling Salesman Problem recipes for the Vehicle Routing solver.
5 The Vehicle Routing solver can be used to solve a Travelling Salesman Problem
|
| /dports/german/BBBike/BBBike-3.18/plugins/ |
| H A D | BBBikeSalesman.pm | 96 $main::ch->attach($salesman_check, -pod => "^\\s*Salesman-Symbol");
110 require Salesman;
121 $salesman = new Salesman
|
| /dports/math/py-mip/mip-1.13.0/docs/coin-or-cup/ |
| H A D | references.bib | 49 …s/IntegerProgramming/apps/Integer Programming Formulations of Traveling Salesman Problems.pdf:pdf},
54 title = {{Integer Programming Formulation of Traveling Salesman Problems}},
|
| /dports/x11-toolkits/tix/Tix8.4.3/demos/samples/ |
| H A D | SHList2.tcl | 73 {andy peter "Andreas Crawford" Salesman}
75 {jon peter "Jon Baraki" Salesman}
|
| /dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/ |
| H A D | README | 2 to solve the Vehicle Routing Problem and Traveling Salesman Problem.
|
| /dports/math/gsl/gsl-2.7/doc/ |
| H A D | siman.rst | 221 Traveling Salesman Problem
224 The TSP (*Traveling Salesman Problem*) is the classic combinatorial
227 States. This should maybe be called the *Flying Salesman Problem*,
298 Initial route for the 12 southwestern cities Flying Salesman Problem.
303 Final (optimal) route for the 12 southwestern cities Flying Salesman Problem.
312 Flying Salesman Problem.
|
| /dports/java/springframework31/spring-framework-3.1.4.RELEASE/projects/org.springframework.core/src/test/java/org/springframework/util/ |
| H A D | MethodInvokerTests.java | 109 methodInvoker.setArguments(new Object[] {new Salesman()}); in testSalesmanWithMethodInvoker()
244 private static class Salesman implements Person { class in MethodInvokerTests
|
| /dports/devel/open-beagle/beagle-3.0.3/examples/GA/tsp/ |
| H A D | INSTALL | 3 Traveling Salesman Problem (tsp): Indices integer vector GA example
|
| H A D | README | 3 Traveling Salesman Problem (tsp): Indices integer vector GA example
|
| /dports/math/py-or-tools/or-tools-9.2/examples/notebook/examples/ |
| H A D | random_tsp.ipynb | 89 "\"\"\"Traveling Salesman Sample.\n",
92 " Traveling Salesman Problem.\n",
114 " help='Size of Traveling Salesman Problem instance.')\n",
|
| /dports/math/glpk/glpk-5.0/examples/ |
| H A D | tsp.mod | 1 /* TSP, Traveling Salesman Problem */
5 /* The Traveling Salesman Problem (TSP) is stated as follows.
|
| /dports/graphics/jgraph/jgraph-8.3_1/ |
| H A D | g9n10.jgr | 58 label : Travelling Salesman
119 label : Travelling Salesman
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/ |
| H A D | README | 6 Routing Problem. It can also solve Traveling Salesman Problem instances and
35 -R: solve as a Traveling Salesman Problem,
|
| /dports/math/py-networkx/networkx-2.6.3/doc/reference/algorithms/ |
| H A D | approximation.rst | 94 Traveling Salesman
|
| /dports/finance/sql-ledger/sql-ledger/locale/id/ |
| H A D | pos | 47 'Salesperson' => 'Salesman',
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Doc/ |
| H A D | biblio.tex | 73 A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman
149 %{\em Solving Large Scale Symmetric Traveling Salesman Problems to
263 %{\em The Traveling Salesman Problem and Minimal Spanning Trees},
312 % Traveling Salesman Problem},
338 %{\em The Traveling Salesman Problem: A Guided
379 Traveling Salesman Problems},
|
| /dports/math/py-networkx/networkx-2.6.3/doc/developer/ |
| H A D | projects.rst | 69 Directed Version of Traveling Salesman Problem
73 the Traveling Salesman Problem (see `#4607`_). The best approximation
|
| /dports/math/glpk/glpk-5.0/examples/tsp/ |
| H A D | README | 3 Salesman Problem (TSP) with the GLPK integer optimizer.
|