Related papers: On bounded pitch inequalities for the min-knapsack…
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The…
In the theory of submanifolds, the following problem is fundamental: to establish simple relationships between the main intrinsic invariants and the main extrinsic invariants of the submanifolds.The basic relationships discovered until now…
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…
In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching…
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in the literature like Two-dimensional Geometric Knapsack…
The goal of this paper is to set a constraint programming framework to solve lot-sizing problems. More specifically, we consider a single-item lot-sizing problem with time-varying lower and upper bounds for production and inventory. The…
This article is dedicated to solving the Einstein constraint equations with apparent horizon boundaries and freely specified mean curvature. The main novelty is that we study the conformal constraint equations assuming only low regularity.
This paper is devoted to the study of $L_p$ Lyapunov-type inequalities for linear systems of equations with Neumann boundary conditions and for any constant $p \geq 1$. We consider ordinary and elliptic problems. The results obtained in the…
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
This paper investigates two related optimal input selection problems for fixed (non-switched) and switched structured systems. More precisely, we consider selecting the minimum cost of inputs from a prior set of inputs, and selecting the…
We present an optimization problem emerging from optimal control theory and situated at the intersection of fractional programming and linear max-min programming on polytopes. A na\"ive solution would require solving four nested, possibly…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We establish a lower bound on the total mass of the time slices of (n + 1)-dimensional asymptotically flat standard static spacetimes under the timelike convergence condition. The inequality can be viewed equivalently as a Minkowski-type…
We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…
We study inequalities connecting the product of uniform norms of polynomials with the norm of their product. This circle of problems include the Gelfond-Mahler inequality for the unit disk and the Kneser-Borwein inequality for the segment…
In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…