Fast heuristics and approximation algorithms

DOI10.1007/978-3-031-04520-2_8MaRDI QIDQ5050148zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen

Publication date 15 November 2022

Published in The Quadratic Unconstrained Binary Optimization Problem (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-04520-2_8

zbMATH Keywords

polynomial time approximationaverage performance bounds

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Recommendations

• The bipartite QUBO
• Mathematical programming models and exact algorithms
• Metaheuristic algorithms
• Complexity and polynomially solvable special cases of QUBO
• QUBO formulations for the graph isomorphism problem and related problems

Cites work

• scientific article; zbMATH DE number 1670809 (Why is no real title available?)
• scientific article; zbMATH DE number 5010630 (Why is no real title available?)
• scientific article; zbMATH DE number 1203238 (Why is no real title available?)
• scientific article; zbMATH DE number 1199854 (Why is no real title available?)
• scientific article; zbMATH DE number 1182757 (Why is no real title available?)
• scientific article; zbMATH DE number 2064409 (Why is no real title available?)
• scientific article; zbMATH DE number 1751736 (Why is no real title available?)
• A PCP characterization of NP with optimal amortized query complexity
• Algorithms for minclique scheduling problems
• Algorithms with large domination ratio
• An FPTAS for minimizing the product of two non-negative linear cost functions
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Analysis of Boolean Functions
• Approximating the Cut-Norm via Grothendieck's Inequality
• Approximating the cut-norm via Grothendieck's inequality
• Cardinality constrained Boolean quadratic polytope
• Computational Complexity
• Differential approximation algorithms for some combinatorial optimization problems
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
• Minimization of half-products
• Modeling Brain Function
• New results on the completion time variance minimization
• On maximization of quadratic form over intersection of ellipsoids with common center
• On the approximability of clique and related maximization problems
• Positive half-products and scheduling with controllable processing times
• Quadratic forms on graphs
• Quadratic programming and combinatorial minimum weight product problems
• Semidefinite relaxation and nonconvex quadratic optimization
• Some optimal inapproximability results
• TSP heuristics: domination analysis and complexity
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

Cited in

(2)

• scientific article; zbMATH DE number 1568943 (Why is no real title available?)
• A large population island framework for the unconstrained binary quadratic problem

This page was built for publication: Fast heuristics and approximation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050148)