Pages that link to "Item:Q1290618"

The following pages link to The node capacitated graph partitioning problem: A computational study (Q1290618):

Displaying 48 items.

• Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
• Orbitopal fixing (Q408377) (← links)
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
• From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• Size-constrained graph partitioning polytopes (Q607006) (← links)
• Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) (← links)
• An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
• Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
• The capacitated max \(k\)-cut problem (Q930343) (← links)
• Cliques and clustering: A combinatorial approach (Q1267180) (← links)
• An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
• Graph bisection revisited (Q1657405) (← links)
• Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
• Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
• Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
• Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
• Optimizing constrained subtrees of trees (Q1914069) (← links)
• An exact algorithm for graph partitioning (Q1942271) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
• Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
• Employee workload balancing by graph partitioning (Q2448894) (← links)
• Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
• Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
• Balanced Partition of a Graph for Football Team Realignment in Ecuador (Q2835691) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
• Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• (Q5140710) (← links)
• A Complementary Column Generation Approach for the Graph Equipartition Problem (Q5155466) (← links)
• ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
• A random-key GRASP for combinatorial optimization (Q6668154) (← links)