A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q415859
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wen-Xing Zhu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MLPart / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2012.663372 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021939221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multilevel algorithms for hypergraph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective multilevel tabu search approach for balanced graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for nonlinear integer programming / rank
 
Normal rank

Latest revision as of 05:00, 7 July 2024

scientific article
Language Label Description Also known as
English
A discrete dynamic convexized method for VLSI circuit partitioning
scientific article

    Statements