1. On the complexity of minimization problems for polynomials in boolean variables;Ageev;Up-ravlyaemye Sistemy,1983
2. A criterion of polynomial-time solvability for the network location problem;Ageev,1992
3. Network Flows. Theory, Algorithms, and Applications;Ahuja,1993
4. Integer programming: Methods, uses, computation;Balinski;Manag. Sci.,1965
5. Approximating the throughput of multiple machines under real-time scheduling;Bar-Noy,1999