Reputation
Next privilege 100 Rep.
Edit community wikis
Badges
5
Newest
 Curious
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Oct
2
comment Reference request: how to find the k'th best solution to the 1-0 knapsack problem?
Your comment is legitimate and I am not sure how to formally define my question. It is more of a philosophical question - how to find the k'th best solution directly without exploring the full search space or the Top k solutions. For example in the standard approach via dynamic programming we are cutting off big chunks of search space that cannot be in the optimal solution. Is it possible to do the same for the k'th best solution?
Sep
29
awarded  Curious
Sep
28
comment Reference request: how to find the k'th best solution to the 1-0 knapsack problem?
Polynomial in the size of the problem and faster than linear in k. Ideally, the complexity would not depend on k.
Sep
28
asked Reference request: how to find the k'th best solution to the 1-0 knapsack problem?
May
22
accepted Algorithm to find the vertices of the equidistant lines between N closed polygonal lines
May
22
comment Algorithm to find the vertices of the equidistant lines between N closed polygonal lines
I mean nonintersecting piecewise linear curves. But I guess the equidistant line is still not polygonal
May
22
revised Algorithm to find the vertices of the equidistant lines between N closed polygonal lines
added 8 characters in body
May
22
asked Algorithm to find the vertices of the equidistant lines between N closed polygonal lines
Jun
25
awarded  Tumbleweed
Apr
4
accepted Solution to the fractional differential equation
Mar
29
revised Solution to the fractional differential equation
added 891 characters in body; edited tags; added 2 characters in body
Mar
26
asked Solution to the fractional differential equation
Jan
23
accepted When the adjoint of a hypoelliptic operator hypoelliptic
Jan
15
asked What is the maximal sparsity of a matrix?
Jan
23
asked Reference Request: Hamiltonian and quantum completeness.
Jan
16
awarded  Scholar
Jan
16
comment Invariant complement to invariant subspace.
Thanks Gil, your help is really appreciated.
Jan
16
accepted Invariant complement to invariant subspace.
Jan
15
awarded  Editor
Jan
15
revised Invariant complement to invariant subspace.
deleted 29 characters in body