The coastal seaspace patrol sector design and allocation problem
From MaRDI portal
Publication:395695
DOI10.1007/s10287-012-0152-4zbMath1282.90092OpenAlexW1992627131MaRDI QIDQ395695
Kevin E. Lunday, Hanif D. Sherali, Brian J. Lunday
Publication date: 30 January 2014
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-012-0152-4
Steiner tree problemcontiguitycut generationreformulation-linearization technique (RLT)objective perturbationsector allocationsector designspanning aborescencesymmetry defeating constraints
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)
Related Items
Achieving full connectivity of sites in the multiperiod reserve network design problem, The Capacitated and Economic Districting Problem, Simultaneous node and link districting in transportation networks: model, algorithms and railway application
Uses Software
Cites Work
- How to make a decision: The analytic hierarchy process
- Solving a large scale districting problem: A case report
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Strong lower bounds for the prize collecting Steiner problem in graphs
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A genetic algorithm approach to multiobjective land use planning
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem
- Configuration of airspace sectors for balancing air traffic controller workload
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- An Optimization Based Heuristic for Political Districting
- Gerrymandering and Convexity
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Integer Programming Formulation of Traveling Salesman Problems
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Integer Programming Models for Sales Resource Allocation
- Police Sector Design Incorporating Preferences of Interest Groups for Equality and Efficiency
- The Snow Disposal Assignment Problem
- Optimal Political Districting by Implicit Enumeration Techniques
- A simulated annealing approach to police district design
