Results 81 to 90 of about 863 (188)
‘Good Enough’: The Use of Satisficing in the Design of Disruptive Innovation in Emerging Economies
ABSTRACT While design has been acknowledged as a fundamental driver of innovation, questions remain about how design affects disruptive innovation from the perspective of consumer perceptions. Drawing from Simon's insights of bounded rationality and satisficing applied within the technology acceptance model (TAM), we propose an integrated, customer ...
Jie Xue, K. Scott Swan
wiley +1 more source
Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source
The Symmetric Traveling Salesman Problem
Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire +3 more sources
An Impact of Improvement-Exchange Heuristics to Quality of Probabilistic TSP Solution
This paper deals with a probabilistic travelling salesman problem (PTSP), which differs from a travelling salesman problem (TSP) [6] in the demand for a customer visit. In PTSP is each customer visited with a given probability only. An objective function
Jaroslav Janacek, Juraj Hurtik
doaj +1 more source
Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem. [PDF]
Saito K, Aono M, Kasai S.
europepmc +1 more source
Dataset for the electric capacitated traveling salesman problem. [PDF]
Gialos A, Zeimpekis V.
europepmc +1 more source
Classifying traveling salesman problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the
Milan Djordjevic +2 more
doaj
Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem. [PDF]
Kyritsis M +3 more
europepmc +1 more source
Algorithm for DNA sequence assembly by quantum annealing. [PDF]
Nałęcz-Charkiewicz K, Nowak RM.
europepmc +1 more source

