A solvable case of the set-partitioning problem
Applicationes Mathematicae (1987)
- Volume: 19, Issue: 2, page 265-277
- ISSN: 1233-7234
Access Full Article
top
How to cite
topM. M. Sysło. "A solvable case of the set-partitioning problem." Applicationes Mathematicae 19.2 (1987): 265-277. <http://eudml.org/doc/264749>.
@article{M1987,
author = {M. M. Sysło},
journal = {Applicationes Mathematicae},
keywords = {travelling salesman; Halin graphs; polynomial-time algorithm; set- partitioning},
language = {eng},
number = {2},
pages = {265-277},
title = {A solvable case of the set-partitioning problem},
url = {http://eudml.org/doc/264749},
volume = {19},
year = {1987},
}
TY - JOUR
AU - M. M. Sysło
TI - A solvable case of the set-partitioning problem
JO - Applicationes Mathematicae
PY - 1987
VL - 19
IS - 2
SP - 265
EP - 277
LA - eng
KW - travelling salesman; Halin graphs; polynomial-time algorithm; set- partitioning
UR - http://eudml.org/doc/264749
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.