scientific article; zbMATH DE number 1054945

MaRDI QIDQ4350061zbMATH OpenFDO

Authors Mauro Dell'Amico, Francesco Maffioli

Publication date 27 October 1997

zbMATH Keywords

heuristicsmetaheuristicsnetwork designundirected graphtabu search algorithm0-1 equicut problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Boolean programming (90C09)

Recommendations

• Solution of large weighted equicut problems
• scientific article; zbMATH DE number 1163705
• Tabu search for graph partitioning
• A branch-and-cut algorithm for the equicut problem
• Engineering branch-and-cut algorithms for the equicut problem

Cited in

(6)

• An efficient approach for large scale graph partitioning
• Engineering branch-and-cut algorithms for the equicut problem
• An effective multilevel tabu search approach for balanced graph partitioning
• Solution of large weighted equicut problems
• Solving zero-one mixed integer programming problems using tabu search
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization

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 Q4350061)