|
|
|
|
Список литературы
|
|
| |
| 1. |
V. E. Alekseev, D. V. Zakharova, “Independent sets in the graphs with bounded minors of the extended incidence matrix”, Journal of Applied and Industrial Mathematics, 5:1 (2011), 14–18    |
| 2. |
S. Arnborg, A. Proskurowski, “Linear time algorithms for NP-hard problems restricted to partial $k$-trees”, Discrete Applied Mathematics, 23:1 (1989), 11–-24  |
| 3. |
S. Artmann, F. Eisenbrand, C. Glanzer, T. Oertel, S. Vempala, R. Weismantel, A note on non-degenerate integer programs with small sub-determinants, arXiv: 1603.09595v1 |
| 4. |
R. Boliac, V. Lozin, “On the clique-width of graphs in hereditary classes”, Lecture Notes in Computer Science, 2518, 2002, 44–54 |
| 5. |
A. Brandstädt, F. F. Dragan, “On linear and circular structure of (claw, net)-free graphs”, Discrete Applied Mathematics, 129:2–3 (2003), 285–303 |
| 6. |
B. Courcelle, J. Makowsky, U. Rotics, “Linear time solvable optimization problems on graphs of bounded clique-width”, Theory of Computing Systems, 33:2 (2000), 125–150 |
| 7. |
R. M. Gray, “Toeplitz and circulant matrices: a review”, Foundations and Trends in Communications and Information Theory, 2:3 (2006), 155–239 |
| 8. |
N. Karmarkar, “A new polynomial time algorithm for linear programming”, Combinatorica, 4:4 (1984), 373–395 |
| 9. |
L. G. Khachiyan, “Polynomial algorithms in linear programming”, USSR Computational Mathematics and Mathematical Physics, 20:1 (1980), 53–72  |
| 10. |
D. Kobler, U. Rotics, “Edge dominating set and colorings on graphs with fixed clique-width”, Discrete Applied Mathematics, 126:2–3 (2003), 197–221 |
| 11. |
Y. E. Nesterov, A. S. Nemirovsky, Interior point polynomial methods in convex programming, SIAM, 1994 |
| 12. |
P. M. Pardalos, C. G. Han, Y. Ye, “Interior point algorithms for solving nonlinear optimization problems”, COAL Newsletter, 19 (1991), 45–54 |
| 13. |
B. Reed, “Mangoes and Blueberries”, Combinatorica, 19:2 (1999), 267–296 |
| 14. |
V. N. Shevchenko, Qualitative topics in integer linear, AMS, 1997 |
| 15. |
S. I. Veselov, A. J. Chirkov, “Integer program with bimodular matrix”, Discrete Optimization, 6:2 (2009), 220–222  |
| 16. |
S. H. Whitesides, “A method for solving certain graph recognition and optimization problems, with applications to perfect graphs.”, Annals of Discrete Mathematics, 88 (1984), 281–297 |
