Adjacent vertices of the all 0-1 programming polytope
Egon Balas; Manfred W. Padberg
RAIRO - Operations Research - Recherche Opérationnelle (1979)
- Volume: 13, Issue: 1, page 3-12
- ISSN: 0399-0559
Access Full Article
top
How to cite
topBalas, Egon, and Padberg, Manfred W.. "Adjacent vertices of the all 0-1 programming polytope." RAIRO - Operations Research - Recherche Opérationnelle 13.1 (1979): 3-12. <http://eudml.org/doc/104709>.
@article{Balas1979,
author = {Balas, Egon, Padberg, Manfred W.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {Programming Polytope},
language = {eng},
number = {1},
pages = {3-12},
publisher = {EDP-Sciences},
title = {Adjacent vertices of the all 0-1 programming polytope},
url = {http://eudml.org/doc/104709},
volume = {13},
year = {1979},
}
TY - JOUR
AU - Balas, Egon
AU - Padberg, Manfred W.
TI - Adjacent vertices of the all 0-1 programming polytope
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 1
SP - 3
EP - 12
LA - eng
KW - Programming Polytope
UR - http://eudml.org/doc/104709
ER -
References
top- 1. E. BALAS and M. PADBERG, On the Set Covering Problem. Operations Research 20, 1972, p. 1152-1161. Zbl0254.90035MR327303
- 2. E. BALAS and M. PADBERG, On the Set Covering Problem. II: An Algorithm for Set Partitioning. Operations Research, 23, 1975, p. 74-90. Zbl0324.90045MR411622
- 3. J. STOER and C. WITZGALL, Convexity and Optimization in Finite Dimensions. I.Springer, New York, 1970. Zbl0203.52203MR286498
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.