Pages that link to "Item:Q752015"
From MaRDI portal
The following pages link to Facets of the clique partitioning polytope (Q752015):
Displaying 34 items.
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Composition of facets of the clique partitioning polytope (Q3972001) (← links)
- Models for machine-part grouping in cellular manufacturing (Q4230175) (← links)
- (Q4242935) (← links)
- The polytope of block diagonal matrices and complete bipartite partitionings (Q4369763) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Transitive packing (Q4645940) (← links)
- Good Clusterings Have Large Volume (Q4971590) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Selected Topics in Critical Element Detection (Q5260999) (← links)
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Efficient joint object matching via linear programming (Q6052052) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← 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)
- Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)
- Integer programming models and polyhedral study for the geodesic classification problem on graphs (Q6556086) (← links)
- Invariant correlation under marginal transforms (Q6615380) (← links)