Related papers: Uniqueness in quadratic and hyperbolic 0-1 program…
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…
The goal of this paper is to study uniqueness of a one-dimensional Hamilton-Jacobi equation \begin{equation*} \begin{cases} u_t=|u_x|^2+R(x,I(t)) &\text{in }\mathbb{R} \times (0,\infty), \max_{\mathbb{R}} u(\cdot,t)=0 &\text{on }[0,\infty),…
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…
We study the uniqueness problem of $\sigma$-regular solution of the equation, $$-\Delta_p u+ \abs u^{q-1}u =h \quad on\quad \RN, $$ where $q>p-1>0.$ and $N> p.$ Other coercive type equations associated to more general differential operators…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
Many academic disciplines - including information systems, computer science, and operations management - face scheduling problems as important decision making tasks. Since many scheduling problems are NP-hard in the strong sense, there is a…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic…
DPLL and resolution are two popular methods for solving the problem of propositional satisfiability. Rather than algorithms, they are families of algorithms, as their behavior depend on some choices they face during execution: DPLL depends…
We develop a new interior-point algorithm for solving multiconic optimization problems using the parabolic target space approach. The feasible cone in these problems is composed as a direct product of many small-dimensional cones. Our…
We discuss a class of time-dependent Hamilton-Jacobi equations, where an unknown function of time is intended to keep the maximum of the solution to the constant value 0. Our main result is that the full problem has a unique viscosity…
Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-hard problems can be expressed as integer programs, in…
We consider quantum algorithms for the unique sink orientation problem on cubes. This problem is widely considered to be of intermediate computational complexity. This is because there no known polynomial algorithm (classical or quantum)…
For a class of equations generalizing the model case \[ \Delta _p u-a(r)u^{p-1}+b(r)u^q=0 \; \; \mbox{in $B$}, \; \; u=0 \; \; \mbox{on $\partial B$}, \] where $B$ is the unit ball in $R^n$, $n \geq 1$, $r=|x|$, $p,q>1$, and $\Delta _p$…
In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial…
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and…
We investigate uniqueness, in suitable weighted Lebesgue spaces, of solutions to a class of fractional parabolic and elliptic equations.
In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as a 0/1 programming and is extremely challenging due to its combinatorial properties. We propose an efficient algorithm for solving it.…