SOLUTION ATTRACTOR OF LOCAL SEARCH SYSTEM: A METHOD TO REDUCE COMPUTATIONAL COMPLEXITY OF THE TRAVELING SALESMAN PROBLEM

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM Workshop on Combinatorial Scientific Computing (2020 : Seattle, Wash.) SIAM Workshop on Combinatorial Scientific Computing (CSC20)
1. Verfasser:	Li, Weiqi (VerfasserIn)
Pages:	20
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
GRAPHS WITH TUNABLE CHROMATIC NUMBERS FOR PARALLEL COLORING	2021	Cheng, Xin
GENERALIZED GAINS FOR HYBRID VERTEX SEPARATOR ALGORITHMS	2021	Kolodziej, Scott P.
A MULTILEVEL MESH PARTITIONING ALGORITHM DRIVEN BY MEMORY CONSTRAINTS	2021	Chevalier, Cédric
MODELING FLUID MIXING IN MICROFLUIDIC GRIDS	2021	Luu, Huong
A PARALLEL PROJECTION METHOD FOR METRIC CONSTRAINED OPTIMIZATION	2021	Ruggles, Cameron
STREET-LEVEL TRAVEL-TIME ESTIMATION VIA AGGREGATED UBER DATA	2021	Maass, Kelsey
WEGOTYOUCOVERED: THE WINNING SOLVER FROM THE PACE 2019 CHALLENGE, VERTEX COVER TRACK	2021	Hespe, Demian
A PARALLEL 2/3-APPROXIMATION ALGORITHM FOR VERTEX-WEIGHTED MATCHING	2021	Al-Herz, Ahmed
AN INEXACT COMBINATORIAL MODEL FOR MAXIMIZING THE NUMBER OF DISCOVERED NONZERO ENTRIES	2021	Rostami, M. A.
CHECKPOINTING APPROACHES FOR THE COMPUTATION OF ADJOINTS COVERING RESILIENCE ISSUES	2021	Bockhorn, Arne
SOLUTION ATTRACTOR OF LOCAL SEARCH SYSTEM: A METHOD TO REDUCE COMPUTATIONAL COMPLEXITY OF THE TRAVELING SALESMAN PROBLEM	2021	Li, Weiqi
FAULT TOLERANCE WITH HIGH PERFORMANCE FOR FAST MATRIX MULTIPLICATION	2021	Birnbaum, Noam
ON SPARSE MATRIX CHAIN PRODUCTS	2021	Naumann, Uwe
MATRIX SYMMETRIZATION AND SPARSE DIRECT SOLVERS	2021	Portase, Raluca
PARALLEL GRAPHBLAS WITH OPENMP	2021	Aznaveh, Mohsen