Transitions from P to NP-hardness: the case of the Linear Ordering Problem-Reference-Cited by-同舟云学术

Transitions from P to NP-hardness: the case of the Linear Ordering Problem

Published:2022-07-18 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE Congress on Evolutionary Computation (CEC)
language:
Short-container-title:

Author:

Elorza Anne¹,Hernando Leticia²,Lozano Jose A.³

Affiliation:

1. University of the Basque Country UPV/EHU,Department of Computer Science and Artificial Intelligence,San Sebastian,Spain

2. University of the Basque Country UPV/EHU,Department of Mathematics,Leioa,Spain

3. Basque Center for Applied Mathematics (BCAM),Bilbao,Spain

Funder

Basque Government

University of the Basque Country

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9870216/9870201/09870392.pdf?arnumber=9870392

Reference16 articles.

1. Taxonomization of combinatorial optimization problems in fourier space;elorza;ArXiv Preprint,2019

2. A Fourier space algorithm for solving quadratic assignment problems

3. Das helmstädtersche reihenfolgeproblem-die effizienz verschiedener näherungsverfahren;becker;Computer uses in the Social Sciences Berichteiner Working Conference,0

4. Intensification and diversification with elite tabu search solutions for the linear ordering problem

5. Fourier theoretic probabilistic inference over permutations;huang;Journal of Machine Learning Research,2009

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fourier Transform-based Surrogates for Permutation Problems;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12

2. Transitions from P to NP-hardness: the case of the Linear Ordering Problem;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18