Zero-One Integer Programming: Understanding and Practical Examples

Explore zero-one integer programming, a key method in logical problem-solving, using binary choices for optimal decisions in finance, production, and more.
Frontiers

Accelerated non-negative tensor completion via integer programming

The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have ...
Scientific Research Publishing

An Integer Programming Model for the KenKen Problem ()

In this paper we consider modeling techniques for the mathematical puzzle KenKen. It is an interesting puzzle from modeling point of view since it has different kind of mathematical restrictions that ...
GitHub

Implementation of the (dynamic) stochastic dual dynamic integer programming (SDDiP) algorithm.

Multistage stochastic mixed-integer linear problems (MSMILPs) are non-convex, usually of large scale, and hard to solve. This calls for decomposition approaches to keep the solution process ...
IEEE

A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models

Abstract: The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems. On the other hand, when the traditional BB structure is ...
Frontiers

A Mixed-Integer Linear Programming Formulation for Optimizing Multi-Scale Material and Energy Integration

Industrial Process and Energy Systems Engineering, École Polytechnique Fédérale de Lausanne, Sion, Switzerland This research presents a mathematical formulation for optimizing integration of complex ...