A memetic algorithm to schedule planned maintenance for the national grid

DOI10.1145/347792.347801zbMath1073.68598OpenAlexW1984844818WikidataQ60568796 ScholiaQ60568796MaRDI QIDQ5463392

Alexander Schwartz, Matthias Müller-Hannemann

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/1999/MuellerMatching/

zbMATH Keywords

object-oriented designb-matchingdesign patternsblossom algorithm

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Theory of software (68N99)

Related Items

Distributed algorithms for covering, packing and maximum weighted matching ⋮ Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems

Uses Software

• TSPLIB
• Blossom IV