Performance of trigonometric generating functions on some combinatorial problems

Nesterov, Yurii
(2005)

Files

dp2005_69.pdf
  • Open Access
  • Adobe PDF
  • 144.97 KB
Download

Details

Authors
  • Nesterov, YuriiUCLouvain
    Author
Abstract
In this paper we analyze computational performance of dual trigonometric generating functions on some integer programming problems. We show that if the number of equality constraints is fixed, then this technique allows to solve the problems in time, which is polynomial in the dimension of the space of variables.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Nesterov, Y. (2005). Performance of trigonometric generating functions on some combinatorial problems (CORE Discussion Papers 2005/69). https://hdl.handle.net/2078.5/35933