A quadratic simplex algorithm for primal optimization over zero-one polytopes

DOI10.1016/J.DAM.2023.12.030MaRDI QIDQ6202952zbMATH OpenOpenAlexWikidataFDO

Authors Sven Mallach

Publication date 27 February 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.12.030

zbMATH Keywords

binary quadratic programmingsimplex algorithmlinearly-constrained quadratic programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Recommendations

• Experiments in quadratic 0-1 programming
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• An algorithm for quadratic zero-one programs
• scientific article; zbMATH DE number 4116303

Cites work

• scientific article; zbMATH DE number 3132305 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 1203226 (Why is no real title available?)
• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Revised Simplex Method for Quadratic Programming
• A Simplified Procedure for Quadratic Programming
• A primal all-integer algorithm based on irreducible solutions
• Adaptive memory tabu search for binary quadratic programs
• An Algorithm for Large-Scale Quadratic Programming
• An integral simplex algorithm for solving combinatorial optimization problems
• Checking local optimality in constrained quadratic programming is NP- hard
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Greedy and local search heuristics for unconstrained binary quadratic programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Methods for convex and general quadratic programming
• New Finite Pivoting Rules for the Simplex Method
• On Quadratic Programming
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Simple Local Search Problems that are Hard to Solve
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• The Simplex Method for Quadratic Programming
• The general quadratic optimization problem
• The quadratic assignment problem
• Total dual integrality and integer polyhedra
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO

This page was built for publication: A quadratic simplex algorithm for primal optimization over zero-one polytopes

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