scientific article; zbMATH DE number 2079803

MaRDI QIDQ4471904zbMATH OpenFDO

Authors Jose Torres-Jimenez, Eduardo Rodriguez-Tello

Publication date 30 July 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1952/19520477.htm

zbMATH Keywords

Bandwidth MetricBandwidth Minimization ProblemGraphsSimulated Annealing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• An improved simulated annealing algorithm for bandwidth minimization
• scientific article; zbMATH DE number 798643
• Exact and heuristic solutions to the bandwidth minimization problem
• Parallel computation for the bandwidth minimization problem

Cited in

(7)

• New results on edge-bandwidth
• An improved simulated annealing algorithm for bandwidth minimization
• The Effective Bandwidth Problem Revisited
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Parallel computation for the bandwidth minimization problem
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem
• Heuristics for matrix bandwidth reduction

This page was built for publication:

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