相关论文: Gomory Integer Programs

Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…

We study the structure of a family of algebras which encodes a generalization of the Pieri Rule for the complex orthogonal group. In particular, we show that each of these algebras has a standard monomial basis and has a flat deformation to…

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show…

Let $A$ be a gentle algebra. For every collection of string and band diagrammes, we consider the constructible subset of the variety of representations containing all modules with this underlying diagramme. We study degenerations of such…

The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that reduce the search space…

This article presents an overview of the theory of integrable systems with symmetries, focusing on toric systems, semitoric systems, and their classifications via decorated polygons. We discuss certain one-parameter families of integrable…

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

In this paper we study certain families of motives, which arise as direct summands of the cohomology of the Dwork family. We computationally find examples of interesting families with the following three properties. Firstly, their geometric…

Motivated by results on the rationality of equivariant Hilbert series of some hierarchical models in algebraic statistics we introduce the Segre product of formal languages and apply it to establish rationality of equivariant Hilbert series…

In this paper we study the well-known Chv\'atal-Gomory (CG) procedure for the class of integer semidefinite programs (ISDPs). We prove several results regarding the hierarchy of relaxations obtained by iterating this procedure. We also…

In this paper, we analyze how sequentially introducing decision variables into an integer program (IP) affects the value function and its level sets. We use a Gilmore-Gomory approach to find parametrized IP value functions over a restricted…

The aim of this paper is to give new insights about families of integrable systems lifting a Hamiltonian $S^1$-space. Specifically, we study one-parameter families $(M^4,\omega,F_t=(J,H_t))_{0 \leq t \leq 1}$ of systems with a fixed…

In this article I study the variation of Selmer groups in families of modular Galois representations that are congruent modulo a fixed prime $p \geq 5$. Motivated by analogies with Goldfeld's conjecture on ranks in quadratic twist families…

We introduce and study families of finite index subgroups of the modular group that generalize the congruence subgroups. Such groups, termed $\phi$-congruence subgroups, are obtained by reducing homomorphisms $\phi$ from the modular group…

There is always a natural embedding of $S_s\wr S_k$ into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this…

We consider the MAP-inference problem for graphical models, which is a valued constraint satisfaction problem defined on real numbers with a natural summation operation. We propose a family of relaxations (different from the famous…

We introduce FI-algebras over a commutative ring $K$ and the category of FI-modules over an FI-algebra. Such a module may be considered as a family of invariant modules over compatible varying $K$-algebras. FI-modules over $K$ correspond to…