Pages that link to "Item:Q1814793"

The following pages link to Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793):

Displaying 30 items.

• Iterated maxima search for the maximally diverse grouping problem (Q323418) (← 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)
• On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
• Orbitopal fixing (Q408377) (← links)
• Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
• From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
• Size-constrained graph partitioning polytopes (Q607006) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• Cliques and clustering: A combinatorial approach (Q1267180) (← links)
• The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
• Cluster analysis and mathematical programming (Q1365055) (← 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)
• Political districting to minimize cut edges (Q2099493) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
• Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
• Compact linearization for binary quadratic problems (Q2477615) (← links)
• Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching (Q2830766) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← 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)