Diskretn. Anal. Issled. Oper., 2011, Volume 18, Number 1

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2011, Volume 18, Number 1

	The enumerative properties of combinatorial partition polynomials A. A. Balaghura, O. V. Kuzmin		3
	Some properties of well-based sequences A. A. Valyuzhenich		15
	On a polinomial solving case of decentralized transportation problem V. T. Dementiev, Yu. V. Shamardin		20
	The complexity of optimal recombination for the traveling salesman problem A. V. Eremeev		27
	Approximation algorithms for graph approximation problems V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya		41
	The approximation algorithm for one problem of searching for subset of vectors A. V. Kel'manov, S. M. Romanchenko		61
	Minimal hard classes of graphs for the edge list-ranking problem D. S. Malyshev		70
	On an extremal family of circulant networks E. A. Monakhova		77
	Scheduling unit-time jobs on parallel processors polytope R. Yu. Simanchev, I. V. Urazova		85