Dynamic optimization on a set of permutations
Mathematica Applicanda (1977)
- Volume: 5, Issue: 9
- ISSN: 1730-2668
Access Full Article
top
Abstract
topHow to cite
topK. Zorychta. "Dynamic optimization on a set of permutations." Mathematica Applicanda 5.9 (1977): null. <http://eudml.org/doc/292701>.
@article{K1977,
abstract = {The classical problem of optimization on the permutation set is considered. The specific approach of the author is based on representing permutations as integer nonnegative solutions of the equation 2x0.+ 2x1 +...+2xn=2n-1 the objective function is assumed to be in the form f(x)= ∑i=0n-1fi(xi,xi+1), which allows the use of dynamic programming. MR0525712 },
author = {K. Zorychta},
journal = {Mathematica Applicanda},
keywords = {graph theory; traveling salesmen problem; },
language = {eng},
number = {9},
pages = {null},
title = {Dynamic optimization on a set of permutations},
url = {http://eudml.org/doc/292701},
volume = {5},
year = {1977},
}
TY - JOUR
AU - K. Zorychta
TI - Dynamic optimization on a set of permutations
JO - Mathematica Applicanda
PY - 1977
VL - 5
IS - 9
SP - null
AB - The classical problem of optimization on the permutation set is considered. The specific approach of the author is based on representing permutations as integer nonnegative solutions of the equation 2x0.+ 2x1 +...+2xn=2n-1 the objective function is assumed to be in the form f(x)= ∑i=0n-1fi(xi,xi+1), which allows the use of dynamic programming. MR0525712
LA - eng
KW - graph theory; traveling salesmen problem;
UR - http://eudml.org/doc/292701
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.