Entry Sidorov:2000:CPT from lncs2000.bib
Last update: Thu May 16 02:07:42 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Sidorov:2000:CPT,
author = "Vladimir Sidorov and Vitaly Telerman and Dmitry
Ushakov",
title = "Constraint Programming Techniques for Solving Problems
on Graphs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1755",
pages = "424--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1755.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1755/17550424.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1755/17550424.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- constraint,
1753(0)200,
1753(0)215,
1753(0)230,
1753(0)308,
1755(0)402,
1755(0)416,
1761(0)206,
1773(0)130,
1800(0)924,
1816(0)228,
1822(0)26,
1835(0)221,
1839(0)650,
1849(0)198,
1851(0)164,
1853(0)260,
1853(0)272,
1853(0)571,
1861(0)285,
1861(0)315,
1861(0)326,
1861(0)384,
1861(0)414,
1861(0)429,
1861(0)448,
1861(0)463,
1861(0)478,
1861(0)867,
1864(0)71,
1864(0)124,
1864(0)233,
1864(0)271,
1864(0)317,
1878(0)414,
1909(0)180,
1909(0)191,
1909(0)201,
1949(0)208,
1955(0)225,
1955(0)326,
1955(0)399,
1974(0)409,
2125(0)300
- Programming,
1752(0)182,
1752(0)327,
1753(0)16,
1753(0)32,
1753(0)47,
1753(0)215,
1753(0)230,
1753(0)278,
1753(0)324,
1755(0)257,
1755(0)311,
1783(0)208,
1784(0)314,
1799(0)1,
1799(0)16,
1799(0)105,
1800(0)218,
1800(0)257,
1800(0)285,
1800(0)293,
1800(0)427,
1800(0)595,
1800(0)974,
1800(0)1134,
1800(0)1192,
1816(0)228,
1816(0)371,
1839(0)262,
1839(0)650,
1850(0)1,
1850(0)179,
1853(0)25,
1853(0)571,
1861(0)300,
1861(0)384,
1861(0)463,
1861(0)478,
1861(0)1285,
1861(0)1300,
1861(0)1315,
1861(0)1330,
1864(0)185,
1877(0)48,
1877(0)89,
1878(0)1,
1878(0)168,
1908(0)258,
1908(0)322,
1909(0)180,
1910(0)337,
1915(0)32,
1933(0)242,
1933(0)250,
1940(0)7,
1940(0)344,
1955(0)225,
1955(0)469,
1974(0)227,
1983(0)199,
1983(0)301,
1983(0)517,
1983(0)532,
2125(0)26
- Solving,
1753(0)200,
1753(0)293,
1754(0)124,
1755(0)93,
1767(0)277,
1770(0)290,
1792(0)72,
1792(0)380,
1800(0)314,
1800(0)423,
1800(0)595,
1807(0)19,
1807(0)392,
1822(0)369,
1839(0)33,
1839(0)133,
1839(0)232,
1839(0)393,
1839(0)403,
1849(0)239,
1861(0)747,
1866(0)147,
1923(0)389,
1932(0)237,
1955(0)225,
1955(0)399,
1955(0)451
- Technique,
1755(0)297,
1755(0)511,
1792(0)107,
1792(0)261,
1800(0)202,
1800(0)269,
1800(0)340,
1800(0)706,
1806(0)1,
1806(0)142,
1806(0)161,
1813(0)283,
1818(0)1,
1839(0)625,
1850(0)394,
1864(0)317,
1902(0)265,
1909(0)82,
1909(0)191,
1910(0)44,
1933(0)17,
1940(0)105,
1940(0)134,
1941(0)246,
1954(0)126,
1956(0)94,
1976(0)546,
1983(0)380