Add a description, image, and links to the binary-linear-programming topic page so that developers can more easily learn about it ...

Discover a groundbreaking technique for solving binary linear programming models in polynomial time. Explore the transformation into convex quadratic programming and the use of interior point ...

Learn how to formulate and solve linear programming problems with integer or binary variables using branch and bound and cutting planes methods.

This paper presents a computationally efficient method for binary classification using Manski’s (1975,1985) maximum score model.

Linear programming (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for ...

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The ...

Lihong Cheng, Lei Feng, Zhiwu Li, Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems, Science Progress (1933-), Vol. 104, No. 3 (2021) ...

We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, and we show ...

Arabinda Tripathy, School Timetabling -- A Case in Large Binary Integer Linear Programming, Management Science, Vol. 30, No. 12 (Dec., 1984), pp. 1473-1489 ...