scientific article; zbMATH DE number 7683726

DOI10.3138/infor.52.1.01MaRDI QIDQ6160407

Justin C. Goodson

Publication date: 9 May 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

election operationsequitable routingsimulated and compressed annealing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

A concise guide to existing and emerging vehicle routing problem variants ⋮ Workload equity in vehicle routing: the impact of alternative workload resources

Cites Work

• Optimization by Simulated Annealing
• Solving a large scale districting problem: A case report
• An optimal method for solving the (generalized) multi-Weber problem
• The traveling salesman problem and its variations
• An Optimization Based Heuristic for Political Districting
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Cooling Schedules for Optimal Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• A Quantitative Model to Plan Regional Health Facility Systems
• A Genetic Algorithm for the Multiple-Choice Integer Program
• Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
• Convergence in Probability of Compressed Annealing

This page was built for publication: