Related papers: Abstract tropical linear programming
In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an intractable estimation problem as one defined on a more tractable graph,…
We show that tropicalization of linear series on curves gives rise to two-parameter families of tilings by polymatroids, with one parameter arising from the theory of divisors on tropical curves and the other from the reduction of linear…
The tropical arithmetic operations on $\mathbb{R}$ are defined by $a\oplus b=\min\{a,b\}$ and $a\otimes b=a+b$. Let $A$ be a tropical matrix and $k$ a positive integer, the problem of Tropical Matrix Factorization (TMF) asks whether there…
We consider the tropical variety $\mathcal{T}(I)$ of a prime ideal $I$ generated by the polynomials $f_1, ..., f_r$ and revisit the regular projection technique introduced by Bieri and Groves from a computational point of view. In…
We define and study the cyclic Bergman fan of a matroid M, which is a simplicial polyhedral fan supported on the tropical linear space T(M) of M and is amenable to computational purposes. It slightly refines the nested set structure on…
In this paper, we study tropical-theoretic aspects of the ``rectification algorithm'' on skew Young tableaux. It is shown that the algorithm is interpreted as a time evolution of some tropical integrable system. By using this fact, we…
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
This article analyzes a key exchange protocol based on the triad tropical semiring, recently proposed by Jackson, J. and Perumal, R. We demonstrate that the triad tropical semiring is isomorphic to a circulant matrix over tropical numbers.…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
Some results on singularities of plurisubharmonic functions are put into the context of tropical mathematics.
We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance…
In this paper, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex hull representation. Based on the solution of the PPR, we also present a MILP…
The aim of this paper is twofold: first, to extend the area of applications of tropical optimization by solving new constrained location problems, and second, to offer new closed-form solutions to general problems that are of interest to…
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…
An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of partially-distinguishable multi-target system. It combines the advantages of engineering solutions like MHT…
In this paper, we consider a new class of generalized Convex structure and we investigate their tropical limits. Some properties are pointing out such that translation homotheticity and others ones allowing to consider the case of discrete…