Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4116303
- scientific article; zbMATH DE number 1382838
- scientific article; zbMATH DE number 3848110
- An Algorithm for Large-Scale Quadratic Programming
- Testing optimality for quadratic 0?1 unconstrained problems
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- scientific article; zbMATH DE number 13594
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
Cited in
(22)- One-pass heuristics for large-scale unconstrained binary quadratic problems
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Polynomial unconstrained binary optimisation -- part 1
- Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems
- Polynomial unconstrained binary optimisation -- part 2
- UOBYQA: unconstrained optimization by quadratic approximation
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Building an iterative heuristic solver for a quantum annealer
- Partial evaluation in rank aggregation problems
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables
- The bipartite QUBO
- The bipartite quadratic assignment problem and extensions
- A hybrid metaheuristic approach to solving the UBQP problem
- Path relinking for unconstrained binary quadratic programming
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- Quadratic reformulations of nonlinear binary optimization problems
- Testing optimality for quadratic 0?1 unconstrained problems
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
This page was built for publication: Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537985)
