en
de
BibSonomy
publication
tag
user
group
author
concept
BibTeX key
search:all
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
URL
DOI
TeX
publication post of
ytyoun
tags
(
ytyoun
's tags highlighted)
k-shortest-paths
yen's
users
ytyoun
in citation format:
www
Harvard
Chicago
APA
DIN 1505
BibTeX
EndNote
all formats
A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem
E.L. Lawler
.
Management Science
(
1972
)
@article{lawler1972procedure, added-at = {2012-07-08T15:24:20.000+0200}, author = {Lawler, E.L.}, biburl = {http://www.bibsonomy.org/bibtex/21e2dcd144574ed41c363d1b1f4bf3baa/ytyoun}, interhash = {667365f4c82f11aa65af8460b222e734}, intrahash = {1e2dcd144574ed41c363d1b1f4bf3baa}, journal = {Management Science}, keywords = {k-shortest-paths yen's}, pages = {401--405}, publisher = {JSTOR}, timestamp = {2012-07-08T15:24:20.000+0200}, title = {A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem}, year = 1972 }
%0 Journal Article %1 lawler1972procedure %A Lawler, E.L. %D 1972 %I JSTOR %J Management Science %K %P 401--405 %T A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem
discussion
(0)
resources (URL, PDF, ...)
additional links:
http://www.jstor.org/stable/2629357
URL:
text:
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
BibTeX key:
lawler1972procedure
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact