Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps [PDF]
, 2007 We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2).
Aras, Raghav +2 more
core +3 more sources
A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2017 While most linear programming (LP) problems can be solved in polynomial time, pure and mixed integer problems are NP-hard and there are no known polynomial time algorithms to solve these problems.
Philimon Nyamugure +3 more
doaj +1 more source
First-Order Mixed Integer Linear Programming
, 2012 Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations. First-order logic (FOL), on the other hand, excels at reasoning about classes of objects, but lacks a rich ...
Gordon, Geoffrey +2 more
openaire +2 more sources
Protograph Based Low-Density Parity-Check Codes Design With Mixed Integer Linear Programming
IEEE Access, 2019 An approach to design protograph-based low-density parity-check (LDPC) codes utilizing mixed integer linear programming (MILP) optimization is presented in this paper.
Wojciech Sulek
doaj +1 more source
Linear constraints for ensuring k‐hop connectivity using mixed‐integer programming for multi‐agent systems [PDF]
, 2023 Rubens J. M. Afonso +4 more
openalex +1 more source
Some lower bounds on sparse outer approximations of polytopes [PDF]
, 2014 Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid inequalities.
Dey, Santanu S. +2 more
core
A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems [PDF]
, 2002 We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the cost function by its lower convex
Croxton, Keely L. +2 more
core
A Mixed-Integer Linear Programming Formulation for Distribution Network Reconfiguration
IEEE AccessThe Distribution Network Reconfiguration (DNR) problem is a well-known problem in the field of power system optimization. It consists of altering the state of the switches in Distribution Networks (DNs), resulting in a topology that is optimal with ...
Aghyles Graine, Jean-Paul Gaubert
doaj +1 more source
, 2018 In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints.
Camisa, Andrea +2 more
core +1 more source
Improved Mixed-Integer Linear Programming Model for Short-Term Scheduling of the Pressing Process in Multi-Layer Printed Circuit Board Manufacturing [PDF]
, 2021 Teeradech Laisupannawong +2 more
openalex +1 more source