Parliament seating assignment problems
From MaRDI portal
Publication:2242347
DOI10.1016/j.ejor.2021.08.002zbMath1490.90297OpenAlexW3194107725MaRDI QIDQ2242347
Dirk Briskorn, Frits C. R. Spieksma, Dries R. Goossens, Bart Vangerven
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://biblio.ugent.be/publication/8723438
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dense and sparse graph partition
- On the complexity of partitioning graphs into connected subgraphs
- Some simplified NP-complete graph problems
- On imposing connectivity constraints in integer programs
- Clustering data that are graph connected
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Hamilton Paths in Grid Graphs
- Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
- Reducibility among Combinatorial Problems
- Approximation and intractability results for the maximum cut problem and its variants
- Disconnecting graphs by removing vertices: a polyhedral approach
This page was built for publication: Parliament seating assignment problems
