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

DOI10.1016/J.DAM.2023.12.030OpenAlexW4391155092WikidataQ129390147 ScholiaQ129390147MaRDI QIDQ6202952FDOQ6202952

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)

Cites Work

• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• The Simplex Method for Quadratic Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Title not available (Why is that?)
• An integral simplex algorithm for solving combinatorial optimization problems
• Simple Local Search Problems that are Hard to Solve
• New Finite Pivoting Rules for the Simplex Method
• Methods for convex and general quadratic programming
• An Algorithm for Large-Scale Quadratic Programming
• The quadratic assignment problem
• Adaptive memory tabu search for binary quadratic programs
• Title not available (Why is that?)
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Greedy and local search heuristics for unconstrained binary quadratic programming
• On Quadratic Programming
• A primal all-integer algorithm based on irreducible solutions
• Checking local optimality in constrained quadratic programming is NP- hard
• Title not available (Why is that?)
• Total dual integrality and integer polyhedra
• The general quadratic optimization problem
• A Revised Simplex Method for Quadratic Programming
• Title not available (Why is that?)
• A Simplified Procedure for Quadratic Programming
• 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)