Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

doi:10.15388/Informatica.2006.138

Zhipeng Lü, Jin-Kao Hao, Fred Glover

https://doi.org/10.1007/978-3-642-12139-5_14

Journal: Volume 6022 (2010), p. 154

Metaheuristic Algorithms

Yang Wang, Jin-Kao Hao

https://doi.org/10.1007/978-3-031-04520-2_9

Book: (2022), p. 241

The 6th International Conference on Soft Computing and Intelligent Systems, and The 13th International Symposium on Advanced Intelligence Systems

Fubito Toyama, Kenji Shoji, Hiroshi Mori, Juichi Miyamichi

https://doi.org/10.1109/SCIS-ISIS.2012.6505143

Conference: (2012), p. 2183

2021 33rd Chinese Control and Decision Conference (CCDC)

Longquan Yong

https://doi.org/10.1109/CCDC52312.2021.9601617

Conference: (2021), p. 1302

Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming

Marcelo de Souza, Marcus Ritt

https://doi.org/10.1007/978-3-319-77449-7_5

Book: Lecture Notes in Computer Science (Evolutionary Computation in Combinatorial Optimization) Volume 10782 (2018), p. 67

Metaheuristic Algorithms

Yang Wang, Jin-Kao Hao

https://doi.org/10.1007/978-3-031-04520-2_9

Book: (2022), p. 241

22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)

Ying Zhou

https://doi.org/10.1109/CSE-EUC.2017.28

Conference: (2017), p. 101

22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)

Ying Zhou

https://doi.org/10.1109/CSE-EUC.2017.28

Conference: (2017), p. 101

2013 Sixth International Conference on Advanced Computational Intelligence (ICACI)

Ying Zhou, Jiahai Wang, Jian Yin

https://doi.org/10.1109/ICACI.2013.6748517

Conference: (2013), p. 281

2018 IEEE Congress on Evolutionary Computation (CEC)

Marcelo de Souza, Marcus Ritt

https://doi.org/10.1109/CEC.2018.8477801

Conference: (2018), p. 1

CVPR 2011

William Brendel, Mohamed Amer, Sinisa Todorovic

https://doi.org/10.1109/CVPR.2011.5995395

Conference: (2011), p. 1273

A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming Problem

Chao Huo, Rongqiang Zeng, Yang Wang, Mingsheng Shang

https://doi.org/10.1007/978-981-10-3614-9_2

Book: Communications in Computer and Information Science (Bio-inspired Computing – Theories and Applications) Volume 682 (2016), p. 10

2017 IEEE Congress on Evolutionary Computation (CEC)

Jialong Shi, Qingfu Zhang, Bilel Derbel, Arnaud Liefooghe

https://doi.org/10.1109/CEC.2017.7969360

Conference: (2017), p. 557

A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1007/978-3-642-29828-8_26

Book: Lecture Notes in Computer Science (Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems) Volume 7298 (2012), p. 395

CVPR 2011

William Brendel, Mohamed Amer, Sinisa Todorovic

https://doi.org/10.1109/CVPR.2011.5995395

Conference: (2011), p. 1273

Tabu-Driven Quantum Neighborhood Samplers

Charles Moussa, Hao Wang, Henri Calandra, Thomas Bäck, Vedran Dunjko

https://doi.org/10.1007/978-3-030-72904-2_7

Book: Lecture Notes in Computer Science (Evolutionary Computation in Combinatorial Optimization) Volume 12692 (2021), p. 100

The 6th International Conference on Soft Computing and Intelligent Systems, and The 13th International Symposium on Advanced Intelligence Systems

Fubito Toyama, Kenji Shoji, Hiroshi Mori, Juichi Miyamichi

https://doi.org/10.1109/SCIS-ISIS.2012.6505143

Conference: (2012), p. 2183

2021 33rd Chinese Control and Decision Conference (CCDC)

Longquan Yong

https://doi.org/10.1109/CCDC52312.2021.9601617

Conference: (2021), p. 1302

Tabu-Driven Quantum Neighborhood Samplers

Charles Moussa, Hao Wang, Henri Calandra, Thomas Bäck, Vedran Dunjko

https://doi.org/10.1007/978-3-030-72904-2_7

Book: Lecture Notes in Computer Science (Evolutionary Computation in Combinatorial Optimization) Volume 12692 (2021), p. 100

A Study of Memetic Search with Multi-parent Combination for UBQP

Zhipeng Lü, Jin-Kao Hao, Fred Glover

https://doi.org/10.1007/978-3-642-12139-5_14

Book: Lecture Notes in Computer Science (Evolutionary Computation in Combinatorial Optimization) Volume 6022 (2010), p. 154

A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1007/978-3-642-29828-8_26

Book: Lecture Notes in Computer Science (Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems) Volume 7298 (2012), p. 395

2017 IEEE Congress on Evolutionary Computation (CEC)

Jialong Shi, Qingfu Zhang, Bilel Derbel, Arnaud Liefooghe

https://doi.org/10.1109/CEC.2017.7969360

Conference: (2017), p. 557

2013 Sixth International Conference on Advanced Computational Intelligence (ICACI)

Ying Zhou, Jiahai Wang, Jian Yin

https://doi.org/10.1109/ICACI.2013.6748517

Conference: (2013), p. 281

2018 IEEE Congress on Evolutionary Computation (CEC)

Marcelo de Souza, Marcus Ritt

https://doi.org/10.1109/CEC.2018.8477801

Conference: (2018), p. 1

A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming Problem

Chao Huo, Rongqiang Zeng, Yang Wang, Mingsheng Shang

https://doi.org/10.1007/978-981-10-3614-9_2

Book: Communications in Computer and Information Science (Bio-inspired Computing – Theories and Applications) Volume 682 (2016), p. 10

Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming

Marcelo de Souza, Marcus Ritt

https://doi.org/10.1007/978-3-319-77449-7_5

Book: Lecture Notes in Computer Science (Evolutionary Computation in Combinatorial Optimization) Volume 10782 (2018), p. 67

A branch-and-bound algorithm for the minimum cut linear arrangement problem

Gintaras Palubeckis, Dalius Rubliauskas

https://doi.org/10.1007/s10878-011-9406-2

Journal: Journal of Combinatorial Optimization Volume 24, Issue 4 (2012), p. 540

A branch-and-bound algorithm for the minimum cut linear arrangement problem

Gintaras Palubeckis, Dalius Rubliauskas

https://doi.org/10.1007/s10878-011-9406-2

Journal: Journal of Combinatorial Optimization Volume 24, Issue 4 (2012), p. 540

A branch-and-bound algorithm for the single-row equidistant facility layout problem

Gintaras Palubeckis

https://doi.org/10.1007/s00291-010-0204-5

Journal: OR Spectrum Volume 34, Issue 1 (2012), p. 1

A branch-and-bound algorithm for the single-row equidistant facility layout problem

Gintaras Palubeckis

https://doi.org/10.1007/s00291-010-0204-5

Journal: OR Spectrum Volume 34, Issue 1 (2012), p. 1

A hybrid metaheuristic approach to solving the UBQP problem

Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.ejor.2010.06.039

Journal: European Journal of Operational Research Volume 207, Issue 3 (2010), p. 1254

A hybrid metaheuristic approach to solving the UBQP problem

Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.ejor.2010.06.039

Journal: European Journal of Operational Research Volume 207, Issue 3 (2010), p. 1254

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem

Ying Zhou, Jiahai Wang, Ziyan Wu, Keke Wu

https://doi.org/10.1016/j.knosys.2017.11.009

Journal: Knowledge-Based Systems Volume 141 (2018), p. 18

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem

Ying Zhou, Jiahai Wang, Ziyan Wu, Keke Wu

https://doi.org/10.1016/j.knosys.2017.11.009

Journal: Knowledge-Based Systems Volume 141 (2018), p. 18

A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem

Gintaras Palubeckis

https://doi.org/10.1016/j.amc.2009.06.043

Journal: Applied Mathematics and Computation Volume 215, Issue 3 (2009), p. 1106

A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem

Gintaras Palubeckis

https://doi.org/10.1016/j.amc.2009.06.043

Journal: Applied Mathematics and Computation Volume 215, Issue 3 (2009), p. 1106

Algorithm Unions for Solving Discrete Optimization Problems

I. V. Sergienko, V. P. Shylo, V. O. Roshchyn

https://doi.org/10.1007/s10559-023-00611-0

Journal: Cybernetics and Systems Analysis Volume 59, Issue 5 (2023), p. 753

Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems

Ivan Sergienko, Vladimir Shylo, Valentyna Roshchyn, Petro Shylo

https://doi.org/10.34229/2707-451X.23.2.2

Journal: Cybernetics and Computer Technologies Issue 2 (2023), p. 11

Backbone guided tabu search for solving the UBQP problem

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1007/s10732-011-9164-4

Journal: Journal of Heuristics Volume 19, Issue 4 (2013), p. 679

Backbone guided tabu search for solving the UBQP problem

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1007/s10732-011-9164-4

Journal: Journal of Heuristics Volume 19, Issue 4 (2013), p. 679

Binary optimization for source localization in the inverse problem of ECG

Danila Potyagaylo, Elisenda Gil Cortés, Walther H. W. Schulze, Olaf Dössel

https://doi.org/10.1007/s11517-014-1176-4

Journal: Medical & Biological Engineering & Computing Volume 52, Issue 9 (2014), p. 717

Binary optimization for source localization in the inverse problem of ECG

Danila Potyagaylo, Elisenda Gil Cortés, Walther H. W. Schulze, Olaf Dössel

https://doi.org/10.1007/s11517-014-1176-4

Journal: Medical & Biological Engineering & Computing Volume 52, Issue 9 (2014), p. 717

Building an iterative heuristic solver for a quantum annealer

Gili Rosenberg, Mohammad Vazifeh, Brad Woods, Eldad Haber

https://doi.org/10.1007/s10589-016-9844-y

Journal: Computational Optimization and Applications Volume 65, Issue 3 (2016), p. 845

Building an iterative heuristic solver for a quantum annealer

Gili Rosenberg, Mohammad Vazifeh, Brad Woods, Eldad Haber

https://doi.org/10.1007/s10589-016-9844-y

Journal: Computational Optimization and Applications Volume 65, Issue 3 (2016), p. 845

Capping methods for the automatic configuration of optimization algorithms

Marcelo de Souza, Marcus Ritt, Manuel López-Ibáñez

https://doi.org/10.1016/j.cor.2021.105615

Journal: Computers & Operations Research Volume 139 (2022), p. 105615

Capping methods for the automatic configuration of optimization algorithms

Marcelo de Souza, Marcus Ritt, Manuel López-Ibáñez

https://doi.org/10.1016/j.cor.2021.105615

Journal: Computers & Operations Research Volume 139 (2022), p. 105615

Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem

Michele Samorani, Yang Wang, Yang Wang, Zhipeng Lv, Fred Glover

https://doi.org/10.1007/s10732-018-9403-z

Journal: Journal of Heuristics Volume 25, Issue 4-5 (2019), p. 629

Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem

Michele Samorani, Yang Wang, Yang Wang, Zhipeng Lv, Fred Glover

https://doi.org/10.1007/s10732-018-9403-z

Journal: Journal of Heuristics Volume 25, Issue 4-5 (2019), p. 629

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Jiahai Wang, Ying Zhou, Jian Yin

https://doi.org/10.1016/j.eswa.2011.05.060

Journal: Expert Systems with Applications Volume 38, Issue 12 (2011), p. 14870

Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem

Jiahai Wang, Ying Zhou, Jian Yin

https://doi.org/10.1016/j.eswa.2011.05.060

Journal: Expert Systems with Applications Volume 38, Issue 12 (2011), p. 14870

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Ying Zhou, Jiahai Wang, Jian Yin

https://doi.org/10.1016/j.eswa.2011.04.195

Journal: Expert Systems with Applications (2011)

Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

Ying Zhou, Jiahai Wang, Jian Yin

https://doi.org/10.1016/j.eswa.2011.04.195

Journal: Expert Systems with Applications (2011)

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems

Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses

https://doi.org/10.1007/s10732-022-09498-0

Journal: Journal of Heuristics (2022)

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems

Ricardo N. Liang, Eduardo A. J. Anacleto, Cláudio N. Meneses

https://doi.org/10.1007/s10732-022-09498-0

Journal: Journal of Heuristics Volume 28, Issue 4 (2022), p. 433

Diversification-driven tabu search for unconstrained binary quadratic problems

Fred Glover, Zhipeng Lü, Jin-Kao Hao

https://doi.org/10.1007/s10288-009-0115-y

Journal: 4OR Volume 8, Issue 3 (2010), p. 239

Diversification-driven tabu search for unconstrained binary quadratic problems

Fred Glover, Zhipeng Lü, Jin-Kao Hao

https://doi.org/10.1007/s10288-009-0115-y

Journal: 4OR Volume 8, Issue 3 (2010), p. 239

Goal seeking Quadratic Unconstrained Binary Optimization

Amit Verma, Mark Lewis

https://doi.org/10.1016/j.rico.2022.100125

Journal: Results in Control and Optimization Volume 7 (2022), p. 100125

Goal seeking Quadratic Unconstrained Binary Optimization

Amit Verma, Mark Lewis

https://doi.org/10.1016/j.rico.2022.100125

Journal: Results in Control and Optimization Volume 7 (2022), p. 100125

Greedy permanent magnet optimization

Alan A. Kaptanoglu, Rory Conlin, Matt Landreman

https://doi.org/10.1088/1741-4326/acb4a9

Journal: Nuclear Fusion Volume 63, Issue 3 (2023), p. 036016

Greedy permanent magnet optimization

Alan A. Kaptanoglu, Rory Conlin, Matt Landreman

https://doi.org/10.1088/1741-4326/acb4a9

Journal: Nuclear Fusion Volume 63, Issue 3 (2023), p. 036016

Learnable tabu search guided by estimation of distribution for maximum diversity problems

Jiahai Wang, Ying Zhou, Yiqiao Cai, Jian Yin

https://doi.org/10.1007/s00500-011-0780-6

Journal: Soft Computing Volume 16, Issue 4 (2012), p. 711

Learnable tabu search guided by estimation of distribution for maximum diversity problems

Jiahai Wang, Ying Zhou, Yiqiao Cai, Jian Yin

https://doi.org/10.1007/s00500-011-0780-6

Journal: Soft Computing Volume 16, Issue 4 (2012), p. 711

Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

Yiqiao Cai, Jiahai Wang, Jian Yin, Yalan Zhou

https://doi.org/10.1016/j.eswa.2010.12.124

Journal: Expert Systems with Applications Volume 38, Issue 6 (2011), p. 7817

Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

Yiqiao Cai, Jiahai Wang, Jian Yin, Yalan Zhou

https://doi.org/10.1016/j.eswa.2010.12.124

Journal: Expert Systems with Applications Volume 38, Issue 6 (2011), p. 7817

Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems

Jialong Shi, Jianyong Sun, Qingfu Zhang

https://doi.org/10.1016/j.asoc.2021.107157

Journal: Applied Soft Computing Volume 103 (2021), p. 107157

Multi-objectivization inspired metaheuristics for the sum-of-the-parts combinatorial optimization problems

Jialong Shi, Jianyong Sun, Qingfu Zhang

https://doi.org/10.1016/j.asoc.2021.107157

Journal: Applied Soft Computing Volume 103 (2021), p. 107157

Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Xiangjing Lai, Zhipeng Lü

https://doi.org/10.1016/j.cor.2012.09.003

Journal: Computers & Operations Research Volume 40, Issue 5 (2013), p. 1401

Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Xiangjing Lai, Zhipeng Lü

https://doi.org/10.1016/j.cor.2012.09.003

Journal: Computers & Operations Research Volume 40, Issue 5 (2013), p. 1401

Novel Algorithms for Quadratic Programming by Using Hypergraph Representations

Dávid Tisza, András Oláh, János Levendovszky

https://doi.org/10.1007/s11277-014-1639-9

Journal: Wireless Personal Communications Volume 77, Issue 3 (2014), p. 2305

Novel Algorithms for Quadratic Programming by Using Hypergraph Representations

Dávid Tisza, András Oláh, János Levendovszky

https://doi.org/10.1007/s11277-014-1639-9

Journal: Wireless Personal Communications Volume 77, Issue 3 (2014), p. 2305

Path relinking for unconstrained binary quadratic programming

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.ejor.2012.07.012

Journal: European Journal of Operational Research Volume 223, Issue 3 (2012), p. 595

Path relinking for unconstrained binary quadratic programming

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.ejor.2012.07.012

Journal: European Journal of Operational Research Volume 223, Issue 3 (2012), p. 595

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.cor.2011.12.006

Journal: Computers & Operations Research Volume 40, Issue 12 (2013), p. 3100

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao

https://doi.org/10.1016/j.cor.2011.12.006

Journal: Computers & Operations Research Volume 40, Issue 12 (2013), p. 3100

Qfold: a new modeling paradigm for the RNA folding problem

Mark W. Lewis, Amit Verma, Todd T. Eckdahl

https://doi.org/10.1007/s10732-021-09471-3

Journal: Journal of Heuristics Volume 27, Issue 4 (2021), p. 695

Qfold: a new modeling paradigm for the RNA folding problem

Mark W. Lewis, Amit Verma, Todd T. Eckdahl

https://doi.org/10.1007/s10732-021-09471-3

Journal: Journal of Heuristics Volume 27, Issue 4 (2021), p. 695

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Saïd Hanafi, Ahmed-Riadh Rebai, Michel Vasquez

https://doi.org/10.1007/s10732-011-9169-z

Journal: Journal of Heuristics Volume 19, Issue 4 (2013), p. 645

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Saïd Hanafi, Ahmed-Riadh Rebai, Michel Vasquez

https://doi.org/10.1007/s10732-011-9169-z

Journal: Journal of Heuristics Volume 19, Issue 4 (2013), p. 645

Simple and fast novel diversification approach for the UBQP based on sequential improvement local search

Bahram Alidaee, Hugh Sloan, Haibo Wang

https://doi.org/10.1016/j.cie.2017.07.012

Journal: Computers & Industrial Engineering Volume 111 (2017), p. 164

Simple and fast novel diversification approach for the UBQP based on sequential improvement local search

Bahram Alidaee, Hugh Sloan, Haibo Wang

https://doi.org/10.1016/j.cie.2017.07.012

Journal: Computers & Industrial Engineering Volume 111 (2017), p. 164

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

V. P. Shylo, O. V. Shylo

https://doi.org/10.1007/s10559-011-9368-5

Journal: Cybernetics and Systems Analysis Volume 47, Issue 6 (2011), p. 889

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

V. P. Shylo, O. V. Shylo

https://doi.org/10.1007/s10559-011-9368-5

Journal: Cybernetics and Systems Analysis Volume 47, Issue 6 (2011), p. 889

Tabu search with strategic oscillation for the quadratic minimum spanning tree

Manuel Lozano, Fred Glover, Carlos García-Martínez, Francisco Javier Rodríguez, Rafael Martí

https://doi.org/10.1080/0740817X.2013.768785

Journal: IIE Transactions Volume 46, Issue 4 (2014), p. 414

Tabu search with strategic oscillation for the quadratic minimum spanning tree

Manuel Lozano, Fred Glover, Carlos García-Martínez, Francisco Javier Rodríguez, Rafael Martí

https://doi.org/10.1080/0740817X.2013.768785

Journal: IIE Transactions Volume 46, Issue 4 (2014), p. 414

The unconstrained binary quadratic programming problem: a survey

Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang

https://doi.org/10.1007/s10878-014-9734-0

Journal: Journal of Combinatorial Optimization Volume 28, Issue 1 (2014), p. 58

The unconstrained binary quadratic programming problem: a survey

Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang

https://doi.org/10.1007/s10878-014-9734-0

Journal: Journal of Combinatorial Optimization Volume 28, Issue 1 (2014), p. 58

Export citation

Copy and paste formatted citation

Download citation in file

Authors