( en | de | ru )

 

Disambiguation of "Fortz, Bernard"

Author of the publication

copydeleteadd this publication to your clipboard
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem.

, , and . Networks, 69 (1): 110-123 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bernard Willkofer

Dirk Bernard

Bernard Broermann

Bernard Andreae

Bernard Schmidtmann

 

Other publications of authors with the same name

Optimizing OSPF/IS-IS weights in a changing world., and . IEEE J. Sel. Areas Commun., 20 (4): 756-767 (2002)Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol., , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 242-254. Springer, (2014)Polyhedral results for two-connected networks with bounded rings., and . Math. Program., 93 (1): 27-54 (2002)Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem., , and . Eur. J. Oper. Res., 256 (1): 242-251 (2017)Editorial: Preface to the Special Issue., and . Networks, 58 (2): 81-82 (2011)Min-max optimization of node-targeted attacks in service networks., , , and . Networks, 83 (2): 256-288 (March 2024)The 2 edge-disjoint 3-paths polyhedron., , and . Ann. des Télécommunications, 73 (1-2): 29-36 (2018)On the Hazmat Transport Network Design Problem., , and . INOC, volume 6701 of Lecture Notes in Computer Science, page 327-338. Springer, (2011)Optimization of OSPF Routing in IP Networks., , , , , , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)Methods for Designing Reliable Networks with Bounded Meshes, , and . page 341-350. (1997)