Optimizing in Graphs with Expensive Computation of Edge Weights

DOI10.1007/978-3-540-77903-2_67MaRDI QIDQ5391961zbMATH OpenOpenAlexFDO

Authors Frank Noé, Marcus Oswald, Gerhard Reinelt

Publication date 7 April 2011

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77903-2_67

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites work

• A note on two problems in connexion with graphs
• Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the Alpha_L \leftrightharpoons Beta \leftrightharpoons Alpha_R Transitions in Octaalanine
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Cited in

(1)

• Optimization problems for weighted graphs and related correlation estimates

This page was built for publication: Optimizing in Graphs with Expensive Computation of Edge Weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391961)