RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika

Diskr. Mat., 1999, Volume 11, Issue 2, Pages 112–117 (Mi dm376)

A recurrent algorithm for solving a combinatorial problem on arrangements with restrictions
I. I. Trub

This publication is cited in the following articles:
  1. Zhang D., Li Zh., Zhang Ch., Duan X., “Problem solving to complex combination based on normal generating functions and its application to freight transportation grouping”, IEEE/Soli'2008: Proceedings of 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, 2008, 372–376  crossref  mathscinet  isi  scopus
  2. N. K. Timofeeva, “Methods of Constructing Argument of Objective Function in Combinatorial Optimization Problems”, Cybernetics and Systems Analysis, 38:6 (2002), 873  crossref


© Steklov Math. Inst. of RAS, 2026