( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Models and methods for frequency assignment with cumulative interference constraints.

, , , , и . Int. Trans. Oper. Res., 15 (3): 307-324 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mira Didi

Edith Didi

Didi Surian

Akos Sigmund Bihari

Bhanwarlal Bihani

 

Другие публикации лиц с тем же именем

Graph Decomposition Approaches for Terminology Graphs., , , и . MICAI, том 4827 из Lecture Notes in Computer Science, стр. 883-893. Springer, (2007)Polyhedral study of the connected subgraph problem., , и . Discret. Math., 338 (1): 80-92 (2015)An exact algorithm for solving the vertex separator problem., и . J. Glob. Optim., 49 (3): 425-434 (2011)Algorithms and formulations for the minimum cut separator problem., и . Electron. Notes Discret. Math., (2010)Models and methods for frequency assignment with cumulative interference constraints., , , , и . Int. Trans. Oper. Res., 15 (3): 307-324 (2008)On the minimum cut separator problem., и . Networks, 59 (1): 30-36 (2012)A note on the problem of r disjoint (s, t)-cuts and some related issues., и . Oper. Res. Lett., 46 (3): 335-338 (2018)On the Polytope of the (1, 2)-Survivable Network Design Problem., , и . SIAM J. Discret. Math., 22 (4): 1640-1666 (2008)Steiner k-Edge Connected Subgraph Polyhedra., и . J. Comb. Optim., 4 (1): 131-144 (2000)On the 3-Terminal Cut Polyhedron.. SIAM J. Discret. Math., 19 (3): 575-587 (2005)