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 Posets
ideas.repec.org
Hermann Buer. (Technical University of Aachen, Templergraben 64, D Aachen, Federal Republic of Germany). Rolf H. Möhring. (Technical University of ...
testcalameo.com
www.calameo.com
14 [BM83] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8: , [BM83] Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8: ,
Chapter 3WU Wien
statmath.wu.ac.at
[2] Hermann Buer and Rolf H. Möhring. “A Fast Algorithm for the Decom- position of Graphs and Posets”. In: Mathematics of Operations Research (1983), pp ... [2] Hermann Buer and Rolf H. Möhring. “A Fast Algorithm for the Decom- position of Graphs and Posets”. In: Mathematics of Operations Research (1983), pp ...
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): ...
Vol. 8, No. 2, May, of Mathematics of Operations ...jstor
www.jstor.org
). Hermann Buer and Rolf H. Möhring. https://www.jstor.org/stable Save. Cite. xml · A Superlinearly Convergent Algorithm for One-Dimensional ). Hermann Buer and Rolf H. Möhring. https://www.jstor.org/stable Save. Cite. xml · A Superlinearly Convergent Algorithm for One-Dimensional ...
Mathematics of Operations Research, Volume 8DBLP
dblp.org
Hermann Buer, Rolf H. Möhring: A Fast Algorithm for the Decomposition of Graphs and Posets view. electronic edition via DOI · unpaywalled version ... Hermann Buer, Rolf H. Möhring: A Fast Algorithm for the Decomposition of Graphs and Posets view. electronic edition via DOI · unpaywalled version ...
Rolf H. MöhringDBLP
dblp.org
Hermann Buer, Rolf H. Möhring: A Fast Algorithm for the Decomposition of Graphs and Posets. Math. Oper. Res. 8(2): (1983). [+][–]. Coauthor network. Hermann Buer, Rolf H. Möhring: A Fast Algorithm for the Decomposition of Graphs and Posets. Math. Oper. Res. 8(2): (1983). [+][–]. Coauthor network.
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): ...
Critically indecomposable graphs | Request PDFResearchGate
www.researchgate.net
Hermann Buer · Rolf H. Möhring. Many combinatorial (optimization) problems of graphs (e.g., finding maximal independent sets or maximum ... Hermann Buer · Rolf H. Möhring. Many combinatorial (optimization) problems of graphs (e.g., finding maximal independent sets or maximum ...
EconPapers: A Fast Algorithm for the Decomposition of Graphs and...
econpapers.repec.org
By Hermann Buer and Rolf H. Möhring; Abstract: Many combinatorial (optimization) problems of graphs (e.g., finding maximal independent sets ...
Alle Infos zum Namen "Hermann Buer"
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.
Bibliographie d'algorithmes de d composition modulaire - IGMInstitut d'Electronique et d'Informatique Gaspard Monge
igm.univ-mlv.fr
Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8: , BV Hermann Buer and Rolf H. Möhring. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research, 8: , BV
References
wwwmayr.in.tum.de
References. [1] Hermann Buer and Rolf Möhring. A fast algorithm for the decomposition. of graphs and posets. Math. Oper. Res., 8(2):170–184, 1983, May. 1.
Verwandte Suchanfragen zu Hermann Buer
Volker Niermann Stephan Thelen |
Person "Buer" (1) Vorname "Hermann" (23989) Name "Buer" (223) |
sortiert nach Relevanz / Datum