Preprocessing for a map sectorization problem by means of mathematical programming
From MaRDI portal
Publication:490244
DOI10.1007/s10479-013-1447-8zbMath1304.90180OpenAlexW1980633086MaRDI QIDQ490244
Xin Tang, Ameur Soukhal, Vincent T'kindt
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1447-8
Related Items
Scheduling evacuation operations ⋮ A new integer linear programming formulation for the problem of political districting ⋮ Goal programming approach for political districting in Santa Catarina state: Brazil ⋮ Metaheuristics for the minimum gap graph partitioning problem ⋮ Uniform and most uniform partitions of trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ordered capacitated facility location problem
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Optimal location with equitable loads
- Cluster analysis and mathematical programming
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- A tabu search heuristic and adaptive memory procedure for political districting
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- An Optimization Based Heuristic for Political Districting
- Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
- Integer Programming Formulation of Traveling Salesman Problems
- A Cross Decomposition Algorithm for Capacitated Facility Location
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Evaluation and Optimization of Electoral Systems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Approximation Algorithms for Directed Steiner Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimal Political Districting by Implicit Enumeration Techniques
- The steiner problem in graphs
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Preprocessing for a map sectorization problem by means of mathematical programming
