The following pages link to Min-cut clustering (Q1321669):
Displaying 50 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)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- Graph clustering (Q458448) (← links)
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Maximum cut in fuzzy nature: models and algorithms (Q964947) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Graph bisection revisited (Q1657405) (← links)
- Spectral clustering with local projection distance measurement (Q1666683) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Performance analysis and optimization of web proxy servers and mirror sites (Q1848375) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Distance preserving model order reduction of graph-Laplacians and cluster analysis (Q2059823) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
