98 uppsatser · sida 3 av 7
ur den administrativa och tekniska personalens synvinkel
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
arbetspraxis och modell i ett kunskapsföretag
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
en kvalitativ undersökning på Volvo Cars Uddevalla
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
semiotisk analys av marknadsföring på Internet
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
en observationsstudie om mobiltelefonvanor
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
aspekter på implementation och användning av IT-stöd i omogna nätverksorganisationer
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
en studie av hjälpmedelsanpassning
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
en förstudie i hur programvaruutvecklares inställning påverkar deras arbete
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
ett komplement till VIPS
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
Tablet PC för klinisk dokumentation vid postoperativ vård - en kvalitativ studie för OP/IVA kliniken på Uddevalla sjukhus
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
en attitydstudie
… methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restarting a local search porcedure on this modified solution …
