Publication

A polynomial case of inconstrained zero-one queadratic optimization

Thomas Liebling, Komei Fukuda
2001
Journal Articles

Abstract

Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A polynomial case of inconstrained zero-one queadratic optimization

Chat with Graph Search

CuClarabel: GPU Acceleration for a Conic Optimization Solver

Low-Rank Optimization Methods Based on Projected Projected-Gradient Descent That Accumulate at Bouligand Stationary Points

Convex and Reverse Convex Prequadratics Constraints for Decidable Logics of Relations with Cardinalities