Pages that link to "Item:Q2220903"
From MaRDI portal
The following pages link to Parsimonious formulations for low-diameter clusters (Q2220903):
Displaying 18 items.
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Parsimonious cluster systems (Q481907) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- Developing the Inparcom family of cluster complexes (Q2654976) (← links)
- Advantage of Overlapping Clusters for Minimizing Conductance (Q2894491) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- Highly efficient stepped wedge designs for clusters of unequal size (Q6047754) (← links)
- A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables (Q6088551) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
