Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s12532-022-00228-y
+Normal rank
@@ Property / OpenAlex ID @@
+W4309305091
@@ Property / OpenAlex ID: W4309305091 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5241193
@@ Property / cites work: Q5241193 / rank @@
+Normal rank
@@ Property / cites work @@
+A shifting algorithm for constrained min-max partition on trees
+Normal rank
@@ Property / cites work @@
+Statistical mechanics of complex networks
@@ Property / cites work: Statistical mechanics of complex networks / rank @@
+Normal rank
@@ Property / cites work @@
+The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
+Normal rank
@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
+Normal rank
@@ Property / cites work @@
+Detecting critical nodes in sparse graphs
@@ Property / cites work: Detecting critical nodes in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the monotonization of polyhedra
@@ Property / cites work: On the monotonization of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+Q3951567
@@ Property / cites work: Q3951567 / rank @@
+Normal rank
@@ Property / cites work @@
+Compact vs. exponential-size LP relaxations
@@ Property / cites work: Compact vs. exponential-size LP relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
+Normal rank
@@ Property / cites work @@
+The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs
+Normal rank
@@ Property / cites work @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+The discipline number of a graph
@@ Property / cites work: The discipline number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The equipartition polytope. I: Formulations, dimension and basic facets
+Normal rank
@@ Property / cites work @@
+Extended formulations in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Dominants and submissives of matching polyhedra
@@ Property / cites work: Dominants and submissives of matching polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to police district design
+Normal rank
@@ Property / cites work @@
+Branch and cut algorithms for detecting critical nodes in undirected graphs
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3753826
@@ Property / cites work: Q3753826 / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and valid inequalities of the node capacitated graph partitioning problem
+Normal rank
@@ Property / cites work @@
+The node capacitated graph partitioning problem: A computational study
+Normal rank
@@ Property / cites work @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+New approaches for optimizing over the semimetric polytope
+Normal rank
@@ Property / cites work @@
+Q5645210
@@ Property / cites work: Q5645210 / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for a clustering problem
+Normal rank
@@ Property / cites work @@
+Facets of the clique partitioning polytope
@@ Property / cites work: Facets of the clique partitioning polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Mixed-integer programming techniques for the connected max-\(k\)-cut problem
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a weighted tree into subtrees with weights in a given range
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+VLSI Physical Design: From Graph Partitioning to Timing Closure
+Normal rank
@@ Property / cites work @@
+A Linear Tree Partitioning Algorithm
@@ Property / cites work: A Linear Tree Partitioning Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Size-constrained graph partitioning polytopes
@@ Property / cites work: Size-constrained graph partitioning polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3974969
@@ Property / cites work: Q3974969 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithm for the Partitioning of Trees
@@ Property / cites work: Efficient Algorithm for the Partitioning of Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum vertex blocker clique problem
@@ Property / cites work: Minimum vertex blocker clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum edge blocker dominating set problem
@@ Property / cites work: Minimum edge blocker dominating set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques and clustering: A combinatorial approach
@@ Property / cites work: Cliques and clustering: A combinatorial approach / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for computing \(k\)-edge survivability of a network
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
+Normal rank
@@ Property / cites work @@
+The clique partitioning problem: Facets and patching facets
+Normal rank
@@ Property / cites work @@
+Disconnecting graphs by removing vertices: a polyhedral approach
+Normal rank
@@ Property / cites work @@
+Solving the Distance-Based Critical Node Problem
@@ Property / cites work: Solving the Distance-Based Critical Node Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph clustering
@@ Property / cites work: Graph clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+On generating maximal nondominated Benders cuts
@@ Property / cites work: On generating maximal nondominated Benders cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of network interdiction models and algorithms
+Normal rank
@@ Property / cites work @@
+\(b\)-tree facets for the simple graph partitioning polytope
+Normal rank
@@ Property / cites work @@
+Facet-defining inequalities for the simple graph partitioning polytope
+Normal rank
@@ Property / cites work @@
+Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Political districting to minimize cut edges
@@ Property / cites work: Political districting to minimize cut edges / rank @@
+Normal rank
@@ Property / cites work @@
+Imposing Contiguity Constraints in Political Districting Models
+Normal rank
@@ Property / cites work @@
+Integer programming models for detecting graph bipartitions with structural requirements
+Normal rank
@@ Property / cites work @@
+Why Is Maximum Clique Often Easy in Practice?
@@ Property / cites work: Why Is Maximum Clique Often Easy in Practice? / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting critical node structures on graphs: A mathematical programming approach
+Normal rank
@@ Property / cites work @@
+Collective dynamics of ‘small-world’ networks
@@ Property / cites work: Collective dynamics of ‘small-world’ networks / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming methods for solving binary interdiction games
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6102859