Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A mixed heuristic for circuit partitioning

From MaRDI portal
Publication:1856364
Jump to:navigation, search

DOI10.1023/A:1020551011615zbMath1028.90540OpenAlexW1577149024MaRDI QIDQ1856364

Yanyan Li

Publication date: 14 April 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020551011615


zbMATH Keywords

simulated annealingoptimisationTabu Searchcircuit partitioningparallel test pattern generation


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)


Related Items (4)

A hybrid meta-heuristic for multi-objective optimization: MOSATS ⋮ Implementation of scatter search for multi-objective optimization: a comparative study ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem ⋮ Parallelization of population-based multi-objective meta-heuristics: an empirical study


Uses Software

  • MESHPART



This page was built for publication: A mixed heuristic for circuit partitioning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1856364&oldid=14242849"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki