Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Colloquium on Automata, Languages and Programming

Improved Parallel Approximation of a Class of Integer Programming Programming Problems

Noga Alon, Aravind Srinivasan

Published Jul 8, 1996• 2 citations
OpenAlex

Related papers

New bounds on the unconstrained quadratic integer programming problem

George D. Halikias, Imad M. Jaimoukha, U. Malik +1 more

Journal of Global Optimization•Apr 24, 2007•11 citations

On the gap between the quadratic integer programming problem and its semidefinite relaxation

U. Malik, Imad M. Jaimoukha, George D. Halikias +1 more

Mathematical Programming•Dec 30, 2005•34 citations

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints

Christoph Buchheim, Long Trieu

Lecture notes in computer science•Jan 1, 2013•12 citations

An approximation algorithm for indefinite mixed integer quadratic programming

Alberto Del Pia

arXiv:2211.16442•Mathematical Programming•Dec 2, 2022•6 citations

Valid inequalities for binary linear codes

Akın Tanatmis, Stefan Ruzika, Horst W. Hamacher +3 more

We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes. Moreover, we propose an integer programming formulation to calculate the minimum distance of a binary linear code. We exemplarily compute the minimum distance of the (204, 102) LDPC code and the (576, 288) WIMAX code. Using the minimum distance of a code, a new class of valid inequalities is introduced.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•12 citations

Approximation Algorithms for Quadratic Programming

Minyue Fu, Zhi-Quan Tom Luo, Yinyu Ye Y

Journal of Combinatorial Optimization•Mar 1, 1998•79 citations
We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes. Moreover, we propose an integer programming formulation to calculate the minimum distance of a binary linear code. We exemplarily compute the minimum distance of the (204, 102) LDPC code and the (576, 288) WIMAX code. Using the minimum distance of a code, a new class of valid inequalities is introduced.