Heuristics for the central tree problem

DOI10.1007/s10732-009-9111-9zbMath1196.90028OpenAlexW2019469675MaRDI QIDQ707727

D. Kharzeev

Publication date: 8 October 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-009-9111-9

zbMATH Keywords

robustnesslocal searchspanning treeminmax regretcentral tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• A branch and bound algorithm for the robust spanning tree problem with interval data
• Simulated annealing algorithm for the robust spanning tree problem
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust discrete optimization and its applications
• On the complexity of the robust spanning tree problem with interval data
• Interval data minmax regret network optimization problems
• A Benders decomposition approach for the robust spanning tree problem with interval data
• On the Problem of Decomposing a Graph into n Connected Factors
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• The robust spanning tree problem with interval data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristics for the central tree problem