One-pass heuristics for large-scale unconstrained binary quadratic problems
From MaRDI portal
Recommendations
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 1488074 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A Decomposition Method for Quadratic Zero-One Programming
- A branch and bound algorithm for the maximum clique problem
- A quadratic assignment formulation of the molecular conformation problem
- Adaptive memory tabu search for binary quadratic programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An evolutionary heuristic for quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- On the notion of balance of a signed graph
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic knapsack problems
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- The maximum clique problem
Cited in
(22)- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- A column generation approach for the unconstrained binary quadratic programming problem
- Quadratic reformulations of nonlinear binary optimization problems
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- The unconstrained binary quadratic programming problem: a survey
- Pseudo-Boolean optimization
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- A global continuation algorithm for solving binary quadratic programming problems
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- Metaheuristic algorithms
- A hybrid metaheuristic approach to solving the UBQP problem
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- A new approach for modeling and solving set packing problems
- Generalized roof duality
This page was built for publication: One-pass heuristics for large-scale unconstrained binary quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600836)
