Referenzen
| 16. |
Minimum norm problems over transportation polytopes
Linear Algebra Appl.,
31:103--118
1980
|
| 15. |
Worst case analysis of greedy type algorithms for independence systems
Math. Programming Stud.,
(12):120--131
1980
DOI: 10.1007/bfb0120891
|
| 14. |
The relative strength of oracles for independence systems
Special topics of applied mathematics (Proc. Sem., Ges. Math. Datenverarb., Bonn, 1979)
, Seite 195--211.
Herausgeber: North-Holland, Amsterdam-New York,
1980
|
| 13. |
On the RAS-algorithm
Computing,
23(2):189--198
1979
DOI: 10.1007/BF02252097
|
| 12. |
Approximative algorithms for discrete optimization problems
Band 4
Seite 85--120.
1979
|
| 11. |
Some remarks on a classification of oracle-type algorithms
Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, Band 2 (Tagung, Math. Forschungsinst., Oberwolfach, 1978) Band 46
aus Internat. Ser. Numer. Math.
Seite 195--215.
Herausgeber: Birkhäuser, Basel-Boston, Mass.,
1979
|
| 10. |
An algorithm for quadratic optimization over transportation polytopes
Z. Angew. Math. Mech.,
58(7):T459--T461
1978
|
| 9. |
An analysis of the greedy heuristic for independence systems
Ann. Discrete Math.,
2:65--74
1978
|
| 8. |
Colouring criteria for adjacency on 0-1-polyhedra
Math. Programming Stud.,
(8):106--127
1978
DOI: 10.1007/bfb0121197
|
| 7. |
K-greedy algorithms for independence systems
Z. Oper. Res. Ser. A-B,
22(5):A219--A228
1978
DOI: 10.1007/bf01917662
|
| 6. |
Lower bounds on the worst-case complexity of some oracle algorithms
Discrete Math.,
24(3):261--276
1978
|
| 5. |
Worst-case behaviour of polynomial bounded algorithms for independence systems
Z. Angew. Math. Mech.,
58(7):T477--T479
1978
|