Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712464
DOI10.1007/b97946zbMath1092.68631MaRDI QIDQ5712464
No author found.
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68M07: Mathematical problems of computer architecture
68P20: Information storage and retrieval of data
Related Items
Unnamed Item, Hypergraph Cuts with General Splitting Functions, Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Iterated multilevel simulated annealing for large-scale graph conductance minimization, Graph clustering, An exact combinatorial algorithm for minimum graph bisection, An efficient memetic algorithm for the graph partitioning problem, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
Uses Software