Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
DOI10.1504/IJMHEUR.2010.033120zbMATH Open1219.90104OpenAlexW2164584399MaRDI QIDQ537985FDOQ537985
Publication date: 23 May 2011
Published in: International Journal of Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijmheur.2010.033120
Recommendations
- scientific article; zbMATH DE number 4116303
- scientific article; zbMATH DE number 1382838
- scientific article
- 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
metaheuristicscomputational efficiencytabu search0-1 optimisationunconstrained quadratic programming
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Cited In (19)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- Quadratic reformulations of nonlinear binary optimization problems
- \(f\)-flip strategies for unconstrained binary quadratic programming
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Partial evaluation in rank aggregation problems
- The bipartite quadratic assignment problem and extensions
- A tabu search algorithm with controlled randomization for constructing feasible university course timetables
- Path relinking for unconstrained binary quadratic programming
- A hybrid metaheuristic approach to solving the UBQP problem
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- The Bipartite QUBO
- Building an iterative heuristic solver for a quantum annealer
- UOBYQA: unconstrained optimization by quadratic approximation
- Testing optimality for quadratic 0?1 unconstrained problems
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)
