Hermann Buer und Zitiert - Info zur Person

Optimal procedures for the discrete time/cost trade-off ...RePEc: Research Papers in Economics

ideas.repec.org

von EL Demeulemeester · · Zitiert von: 265 — Hermann Buer & Rolf H. Möhring, "A Fast Algorithm for the Decomposition of Graphs and Posets," Mathematics of Operations Research, INFORMS, vol. 8(2) ... von EL Demeulemeester · · Zitiert von: 265 — Hermann Buer & Rolf H. Möhring, "A Fast Algorithm for the Decomposition of Graphs and Posets," Mathematics of Operations Research, INFORMS, vol. 8(2) ...

A Fast Algorithm for the Decomposition of Graphs and PosetsACM Digital Library

dl.acm.org

von H Buer · · Zitiert von: 124 — Authors: · Author Picture Hermann Buer. Technical University of Aachen, Templergraben 64, D Aachen, Federal Republic of Germany. Technical ... von H Buer · · Zitiert von: 124 — Authors: · Author Picture Hermann Buer. Technical University of Aachen, Templergraben 64, D Aachen, Federal Republic of Germany. Technical ...

Enumeration of Pin-PermutationsLaboratoire d'Informatique de Paris-Nord (LIPN)

www-lipn.univ-paris13.fr

von F Bassino · · Zitiert von: 19 — [19] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8(2): ... von F Bassino · · Zitiert von: 19 — [19] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8(2): ...

Enumeration of Pin-PermutationsCORE

core.ac.uk

von F Bassino · · Zitiert von: 19 — [19] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8(2): ... von F Bassino · · Zitiert von: 19 — [19] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8(2): ...

A Fast Algorithm for the Decomposition of Graphs and PosetsINFORMS PubsOnline

pubsonline.informs.org

von H Buer · · Zitiert von: 123 — HERMANN BUER AND ROLF H. MЦHRING. Technical University of Aachen. Many combinatorial (optimization) problems of graphs (e.g., finding maximal independent sets ... von H Buer · · Zitiert von: 123 — HERMANN BUER AND ROLF H. MЦHRING. Technical University of Aachen. Many combinatorial (optimization) problems of graphs (e.g., finding maximal independent sets ...

Algorithmic Approaches to Setup MinimizationSIAM Publications Library

epubs.siam.org

von U Faigle · · Zitiert von: 18 — Hermann Buer, Rolf H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res., 8 (1983), 170–184. Crossref · Web of Science. von U Faigle · · Zitiert von: 18 — Hermann Buer, Rolf H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res., 8 (1983), 170–184. Crossref · Web of Science.

Hermann Buer und Zitiert Person-Info