Search results for "ATSP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
156	Christoph Helmberg	The m-Cost ATSP.	IPCO	1999	DBLP DOI BibTeX RDF
92	Xin Hu 0001, Taejoon Park, Kang G. Shin	Attack-Tolerant Time-Synchronization in Wireless Sensor Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
82	Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra, Vanesa Landero N.	A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem.	KES (1)	2008	DBLP DOI BibTeX RDF	data-mining techniques, genetic algorithm, machine learning, discriminant analysis, Inductive learning
73	Uriel Feige, Mohit Singh	Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
64	Hongxin Zeng, Guohui Zhang, Shili Cao	On Directed Edge Recombination Crossover for ATSP.	ICNC (1)	2006	DBLP DOI BibTeX RDF
64	Matteo Fischetti, Andrea Lodi 0001, Paolo Toth	Solving Real-World ATSP Instances by Branch-and-Cut.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
55	Luciana S. Buriol, Paulo Morelato França, Pablo Moscato	A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem.	J. Heuristics	2004	DBLP DOI BibTeX RDF	local search, metaheuristics, memetic algorithms, asymmetric traveling salesman problem
55	S. S. Thakur 0002, Subrata Nandi, Diganta Goswami, R. Bhattacharjee	Clock Synchronization in IEEE 802.11 Ad Hoc Networks.	CIT	2004	DBLP DOI BibTeX RDF
55	Roger Z. Ríos-Mercado, Jonathan F. Bard	The Flow Shop Scheduling Polyhedron with Setup Time.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	facet-defining inequalities, polyhedral combinatorics, setup times, flow shop scheduling, asymmetric traveling salesman problem, linear ordering problem
55	Thành Nguyen 0001	A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	ATSP, LP relaxation
54	David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich	Transformations of generalized ATSP into ATSP.	Oper. Res. Lett.	2003	DBLP DOI BibTeX RDF
45	Lukasz Kowalik, Marcin Mucha	Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality.	WADS	2009	DBLP DOI BibTeX RDF
45	Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen	Tolerance Based Algorithms for the ATSP.	WG	2004	DBLP DOI BibTeX RDF
37	Bodo Manthey, L. Shankar Ram	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
37	Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Luc Vincent	Optimal traversal planning in road networks with navigational constraints.	GIS	2007	DBLP DOI BibTeX RDF	GIS applications, navigational constraints, traversal planning, road-network
37	He Jiang 0001, Xianchao Zhang 0001, Mingchu Li, Haoyang Che	Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Black and white traveling salesman problem, Gavish-Grave LP, Linear programming
37	Eitan Bachmat, Vladimir Braverman	Batched disk scheduling with delays.	SIGMETRICS Perform. Evaluation Rev.	2006	DBLP DOI BibTeX RDF
37	Boris Goldengorin, Gerold Jäger, Paul Molitor	Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.	CAAN	2006	DBLP DOI BibTeX RDF	Construction Heuristics, Traveling Salesman Problem, Tolerances
37	Abderezak Touzene	Approximated tensor sum preconditioner for stochastic automata networks.	IPDPS	2006	DBLP DOI BibTeX RDF
37	Bodo Manthey, L. Shankar Ram	Approximation Algorithms for Multi-criteria Traveling Salesman Problems.	WAOA	2006	DBLP DOI BibTeX RDF
37	Chandra Chekuri, Martin Pál	An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
37	Matthew Andrews, Michael A. Bender, Lisa Zhang	New Algorithms for Disk Scheduling.	Algorithmica	2002	DBLP DOI BibTeX RDF	Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
37	Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi 0001, Leen Stougie, Maurizio Talamo	Algorithms for the On-Line Travelling Salesman.	Algorithmica	2001	DBLP DOI BibTeX RDF	Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
27	Lijun Lang, Antonio Frontera, Alberto Perez, Antonio Bauzá	Computational Study of Driving Forces in ATSP, PDIQ, and P53 Peptide Binding: C═O···C═O Tetrel Bonding Interactions at Work.	J. Chem. Inf. Model.	2023	DBLP DOI BibTeX RDF
27	Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo	Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.	LAGOS	2023	DBLP DOI BibTeX RDF
27	Vera Traub, Jens Vygen	An improved approximation algorithm for ATSP.	STOC	2020	DBLP DOI BibTeX RDF
27	Vera Traub, Jens Vygen	An improved approximation algorithm for ATSP.	CoRR	2019	DBLP BibTeX RDF
27	Urszula Boryczka, Krzysztof Szwarc	The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results.	J. Inf. Telecommun.	2019	DBLP DOI BibTeX RDF
27	Krzysztof Szwarc, Urszula Boryczka	Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP.	ACIIDS (2)	2019	DBLP DOI BibTeX RDF
27	Katarzyna E. Paluch 0001	Maximum ATSP with Weights Zero and One via Half-Edges.	Theory Comput. Syst.	2018	DBLP DOI BibTeX RDF
27	Ola Svensson, Jakub Tarnawski, László A. Végh	Constant factor approximation for ATSP with two edge weights.	Math. Program.	2018	DBLP DOI BibTeX RDF
27	Christos Papalitsas, Theodore Andronikos, Panagiotis Karakostas	Studying the Impact of Perturbation Methods on the Efficiency of GVNS for the ATSP.	ICVNS	2018	DBLP DOI BibTeX RDF
27	Urszula Boryczka, Krzysztof Szwarc	The Adaptation of the Harmony Search Algorithm to the ATSP.	ACIIDS (1)	2018	DBLP DOI BibTeX RDF
27	Krzysztof Szwarc, Urszula Boryczka	A Comparative Study of Different Variants of a Memetic Algorithm for ATSP.	ICCCI (2)	2017	DBLP DOI BibTeX RDF
27	Bastien Cazaux, Eric Rivals	The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
27	Ola Svensson, Jakub Tarnawski, László A. Végh	Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract).	IPCO	2016	DBLP DOI BibTeX RDF
27	Ola Svensson, Jakub Tarnawski, László A. Végh	Constant Factor Approximation for ATSP with Two Edge Weights.	CoRR	2015	DBLP BibTeX RDF
27	Ola Svensson	Approximating ATSP by Relaxing Connectivity.	CoRR	2015	DBLP BibTeX RDF
27	Ola Svensson	Approximating ATSP by Relaxing Connectivity.	FOCS	2015	DBLP DOI BibTeX RDF
27	Katarzyna E. Paluch 0001	Maximum ATSP with Weights Zero and One via Half-Edges.	WAOA	2015	DBLP DOI BibTeX RDF
27	Zhihan Gao 0002	Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.		2015	RDF
27	Katarzyna E. Paluch 0001	Maximum ATSP with Weights Zero and One via Half-Edges.	CoRR	2014	DBLP BibTeX RDF
27	Bastien Cazaux, Eric Rivals	Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings.	Stringology	2014	DBLP BibTeX RDF
27	Remco Germs, Boris Goldengorin, Marcel Turkensteen	Lower tolerance-based Branch and Bound algorithms for the ATSP.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
27	Alistair R. Clark, Reinaldo Morabito, Eli A. V. Toso	Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.	J. Sched.	2011	DBLP DOI BibTeX RDF
27	Jie Bai, Jun Zhu, Genke Yang, Changchun Pan	Collaborative Optimization under a Control Framework for ATSP.	ICSI (1)	2011	DBLP DOI BibTeX RDF
27	Joaquín Pérez Ortega, Rodolfo A. Pazos Rangel, Jorge A. Ruiz-Vanoye, Juan Frausto Solís, Juan Javier González Barbosa, Héctor Joaquín Fraire Huacuja, Ocotlán Díaz-Parra	A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem.	J. Intell. Fuzzy Syst.	2010	DBLP DOI BibTeX RDF
27	Alistair R. Clark, Reinaldo Morabito, Eli A. V. Toso	Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.	J. Sched.	2010	DBLP DOI BibTeX RDF
27	Markus Bläser, L. Shankar Ram, Maxim Sviridenko	Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.	Oper. Res. Lett.	2009	DBLP DOI BibTeX RDF
27	Tongquan Zhang, Weidong Li 0002, Jianping Li 0007	An improved approximation algorithm for the ATSP with parameterized triangle inequality.	J. Algorithms	2009	DBLP DOI BibTeX RDF
27	Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma	Tolerance-based Branch and Bound algorithms for the ATSP.	Eur. J. Oper. Res.	2008	DBLP DOI BibTeX RDF
27	L. Sunil Chandran, L. Shankar Ram	On the relationship between ATSP and the cycle cover problem.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
27	Vicky H. Mak, Andreas T. Ernst	New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP.	Math. Methods Oper. Res.	2007	DBLP DOI BibTeX RDF
27	Markus Bläser, L. Shankar Ram, Maxim Sviridenko	Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.	WADS	2005	DBLP DOI BibTeX RDF
27	Markus Bläser	A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
27	Gregory Z. Gutin, Anders Yeo	Upper bounds on ATSP neighborhood size.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
27	L. Sunil Chandran, L. Shankar Ram	Approximations for ATSP with Parametrized Triangle Inequality.	STACS	2002	DBLP DOI BibTeX RDF
18	Markus Bläser, Bodo Manthey, Oliver Putz	Approximating Multi-criteria Max-TSP.	ESA	2008	DBLP DOI BibTeX RDF
18	Gerold Jäger, Paul Molitor	Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.	COCOA	2008	DBLP DOI BibTeX RDF	Traveling Salesman Problem of Second Order, Heuristic, Traveling Salesman Problem, Exact Algorithm, Assignment Problem
18	Matteo Fischetti, Andrea Lodi 0001	Optimizing over the first Chvátal closure.	Math. Program.	2007	DBLP DOI BibTeX RDF	Separation problems, Chvátal-Gomory cuts, Integer programs, Computational analysis
18	Lukasz Kowalik, Marcin Mucha	35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality.	WADS	2007	DBLP DOI BibTeX RDF
18	Matteo Fischetti, Andrea Lodi 0001	Optimizing over the First Chvàtal Closure.	IPCO	2005	DBLP DOI BibTeX RDF	separation problems, Chvàtal-Gomory cuts, Integer Programs, computational analysis
18	Robert D. Carr, Santosh S. Vempala	On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems.	Math. Program.	2004	DBLP DOI BibTeX RDF
18	Eder N. Mathias, Celso Maciel da Costa, Fernando Luís Dotti, Felipe Martins Müller	DEVOpT: a distributed architecture supporting heuristic and metaheuristic optimization methods.	SAC	2002	DBLP DOI BibTeX RDF	heuristics and metaheuristics, master-slave approach, optimization algorithms, distributed environment