Pages that link to "Item:Q1683690"
From MaRDI portal
The following pages link to On imposing connectivity constraints in integer programs (Q1683690):
Displaying 26 items.
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Parliament seating assignment problems (Q2242347) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Congress seat allocation using mathematical optimization (Q2334468) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- <i>m/n</i>CCS: linear consecutively connected systems subject to combined gap constraints (Q2808211) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- An ILP Model for Multi-Label MRFs With Connectivity Constraints (Q5105684) (← links)
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1} (Q5500393) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
- Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
- Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)
