[КНИГА][B] Integer programming models

M Conforti, G Cornuéjols, G Zambelli, M Conforti… - 2014 - Springer
The importance of integer programming stems from the fact that it can be used to model a
vast array of problems arising from the most disparate areas, ranging from practical ones …

Model predictive control of a multilevel CHB STATCOM in wind farm application using diophantine equations

MR Nasiri, S Farhangi… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
The finite control set model predictive control (FCS-MPC) for power electronic converters
provides high dynamic performance, based on the limited number of inputs and accurate …

[HTML][HTML] Effective lattice point counting in rational convex polytopes

JA De Loera, R Hemmecke, J Tauzer… - Journal of symbolic …, 2004 - Elsevier
This paper discusses algorithms and software for the enumeration of all lattice points inside
a rational convex polytope: we describe LattE, a computer package for lattice point …

Integer-programming software systems

A Atamtürk, MWP Savelsbergh - Annals of operations research, 2005 - Springer
Recent developments in integer-programming software systems have tremendously
improved our ability to solve large-scale instances. We review the major algorithmic …

Mixed integer programming computation

A Lodi - 50 Years of Integer Programming 1958-2008: From the …, 2010 - Springer
The first 50 years of Integer and Mixed-Integer Programming have taken us to a very stable
paradigm for solving problems in a reliable and effective way. We run over these 50 exciting …

[HTML][HTML] Non-standard approaches to integer programming

K Aardal, R Weismantel, LA Wolsey - Discrete Applied Mathematics, 2002 - Elsevier
In this survey we address three of the principal algebraic approaches to integer
programming. After introducing lattices and basis reduction, we first survey their use in …

Valid inequalities for structured integer programs

M Conforti, G Cornuéjols, G Zambelli, M Conforti… - Integer …, 2014 - Springer
In Chaps. 5 and 6 we have introduced several classes of valid inequalities that can be used
to strengthen integer programming formulations in a cutting plane scheme. All these valid …

Hard equality constrained integer knapsacks

K Aardal, AK Lenstra - Mathematics of operations research, 2004 - pubsonline.informs.org
We consider the following integer feasibility problem: Given positive integer numbers a 0, a
1,…, an, with gcd (a 1,…, an)= 1 and a=(a 1,…, an), does there exist a vector x∈ ℤ n≥ 0 …

Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances

K Aardal, RE Bixby, CAJ Hurkens… - INFORMS Journal …, 2000 - pubsonline.informs.org
At the IPCO VI conference Cornuéjols and Dawande proposed a set of 0-1 linear
programming instances that proved to be very hard to solve by traditional methods, and in …

Generalized branching methods for mixed integer programming

S Mehrotra, Z Li - US Patent App. 11/239,645, 2006 - Google Patents
Inventors: Sanjay Mehrotra, Winnetka, IL (US); Zhifeng Li, Cary, NC (US) A method and
system using branching on hyperplanes and half-spaces computed from integral adjoint …