Geodesic
On the complexity of the problem of arrangement on a~line with constraints on minimum distances
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2005), pp. 11-14.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_2005_12_a1,
     author = {G. G. Zabudskii},
     title = {On the complexity of the problem of arrangement on a~line with constraints on minimum distances},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {11--14},
     publisher = {mathdoc},
     number = {12},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/}
}
TY  - JOUR
AU  - G. G. Zabudskii
TI  - On the complexity of the problem of arrangement on a~line with constraints on minimum distances
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2005
SP  - 11
EP  - 14
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/
LA  - ru
ID  - IVM_2005_12_a1
ER  - 
%0 Journal Article
%A G. G. Zabudskii
%T On the complexity of the problem of arrangement on a~line with constraints on minimum distances
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2005
%P 11-14
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/
%G ru
%F IVM_2005_12_a1
G. G. Zabudskii. On the complexity of the problem of arrangement on a~line with constraints on minimum distances. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2005), pp. 11-14. http://geodesic.mathdoc.fr/item/IVM_2005_12_a1/

[1] Geri M., Dzhonson D., Vychislitelnye mashiny i trudno reshaemye zadachi, Mir, M., 1982, 416 pp. | MR

[2] Zabudskii G.G., “Algoritm resheniya odnoi zadachi optimalnogo lineinogo uporyadocheniya”, Izv. vuzov. Matematika, 1997, no. 12, 73–78 | MR | Zbl

[3] Picard J.C., Queranne M., “On the one-dimensional space allocation problem”, Oper. Res., 29:2 (1981), 371–391 | DOI | MR | Zbl

[4] Salmi S., Gonzalez T., “$P$-complete approximation problems”, J. Assoc. Comput. Math., 23:3 (1976), 555–565 | MR