Path relinking for unconstrained binary quadratic programming
From MaRDI portal
Publication:2253377
Recommendations
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The unconstrained binary quadratic programming problem: a survey
- A column generation approach for the unconstrained binary quadratic programming problem
- Greedy and local search heuristics for unconstrained binary quadratic programming
Cites work
- A Decomposition Method for Quadratic Zero-One Programming
- A hybrid metaheuristic approach to solving the UBQP problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A new approach for modeling and solving set packing problems
- A unified modeling and solution framework for combinatorial optimization problems
- Adaptive memory tabu search for binary quadratic programs
- Advanced scatter search for the max-cut problem
- An evolutionary heuristic for quadratic 0-1 programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Fundamentals of scatter search and path relinking
- GRASP for set packing problems.
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2159379 (Why is no real title available?)
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Obtaining test problems via Internet
- On the notion of balance of a signed graph
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Randomized heuristics for the Max-Cut problem
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Scatter Search and Path Relinking: Advances and Applications
- Solving the maxcut problem by the global equilibrium search
- TTT plots: a perl program to create time-to-target plots
Cited in
(34)- The Boolean quadratic programming problem with generalized upper bound constraints
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
- Leveraging special-purpose hardware for local search heuristics
- Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Building an iterative heuristic solver for a quantum annealer
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Bi-objective optimization of biclustering with binary data
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- Capping methods for the automatic configuration of optimization algorithms
- Penalty and partitioning techniques to improve performance of QUBO solvers
- f-flip strategies for unconstrained binary quadratic programming
- Multi-neighborhood based path relinking for two-sided assembly line balancing problem
- The bipartite quadratic assignment problem and extensions
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The unconstrained binary quadratic programming problem: a survey
- A column generation approach for the unconstrained binary quadratic programming problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Metaheuristic algorithms
- The bipartite QUBO
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis
- Enhanced open-source scatter search algorithm for solving quadratic unconstrained binary optimization problems
- On the benefits of a new continuous reformulation for QUBO problems
- A large population island framework for the unconstrained binary quadratic problem
This page was built for publication: Path relinking for unconstrained binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253377)
