Result 1 to 13 of 13 total
Discrete optimization problems with interval parameters. (Russian ;English)
Zh. Vychisl. Mat. Mat. Fiz. 50, No. 5, 836-847 (2010); translation in Comput. Math., Math. Phys. 50, No. 5, 795-804 (2010).
1
General approach to estimating the complexity of postoptimality analysis for discrete optimization problems. (English)
Cybern. Syst. Anal. 46, No. 2, 290-295 (2010); translation from Kibern. Sist. Anal. 2010, No. 2, 134-141 (2010).
2
Equivalent instances of the simple plant location problem. (English)
Comput. Math. Appl. 57, No. 5, 812-820 (2009).
3
Partial inverse assignment problems under $l_{1}$ norm. (English)
Oper. Res. Lett. 35, No. 1, 23-28 (2007).
4
Some necessary conditions and a general sufficiency condition for the validity of a Gilmore-Gomory type patching scheme for the traveling salesman problem. (English)
Algorithmic Oper. Res. 2, No. 1, 22-32 (2007).
5
Volume maximization and orthoconvex approximation of orthogons. (English)
Computing 63, No.4, 317-330 (1999).
6
Robust discrete optimization and its applications. (English)
Nonconvex Optimization and Its Applications. 14. Dordrecht: Kluwer Academic Publishers. xvi, 356 p. Dfl. 270.00; \sterling 119.00; \$ 175.00 (1997).
7
Finding $k$ disjoint paths in a directed planar graph. (English)
SIAM J. Comput. 23, No.4, 780-788 (1994).
8
Automating Pólya theory: The computational complexity of the cycle index polynomial. (English)
Inf. Comput. 105, No.2, 268-288 (1993).
9
On graphs with polynomially solvable maximum-weight clique problem. (English)
Networks 19, No.2, 247-253 (1989).
10
On some complexity properties of N-free posets and posets with bounded decomposition diameter. (English)
Discrete Math. 63, 157-182 (1987).
11
On finding the jump number of a partial order by substitution decomposition. (English)
Order 2, 9-23 (1985).
12
On the existence of fast approximation schemes. (English)
Nonlinear programming 4, Proc. Symp., Madison/Wis. 1980, 415-437 (1981).
13
Result 1 to 13 of 13 total
Start
Contact
Print
General Help
