## New answers tagged integer-programming

2
votes

### Direct algorithm for an integer program

The problem is trivial at least for a half of instances by simply taking $x_1=x_2=\frac{p-1}2$. This gives a solution when the orders of $h_1,h_2$ modulo $p$ divide $\frac{p-1}2$; or when both orders ...

3
votes

Accepted

### Direct algorithm for an integer program

This is an extremely difficult non-linear integer programming problem. The difficulty consists in the restriction $h_1^{x_1}-h_2^{x_2}=kp$ which is hardly handled by known methods. I don't know any ...

Top 50 recent answers are included

#### Related Tags

integer-programming × 191linear-programming × 65

combinatorial-optimization × 31

oc.optimization-and-control × 26

co.combinatorics × 22

computational-complexity × 22

nt.number-theory × 18

algorithms × 17

nonlinear-optimization × 16

linear-algebra × 15

lattices × 15

convex-polytopes × 14

diophantine-equations × 14

convex-optimization × 13

matrices × 10

graph-theory × 9

reference-request × 7

euclidean-lattices × 7

computational-number-theory × 6

lo.logic × 5

total-unimodularity × 5

polynomials × 4

convex-geometry × 4

global-optimization × 4

semidefinite-programming × 4