Exact and heuristic solutions for the prize‐collecting geometric enclosure problem

DOI10.1111/itor.13428WikidataQ130023880 ScholiaQ130023880MaRDI QIDQ6154939

Natanael Ramos, Rafael G. Cano, Cid Carvalho De Souza, Unnamed Author

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsinteger linear programmingcomputational geometryfence enclosureoptimal polygons

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric Knapsack problems
• The nature and meaning of perturbations in geometric computing
• Approximation schemes for degree-restricted MST and red-blue separation problems
• Greedy randomized adaptive search procedures
• Delineating boundaries for imprecise regions
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• On the convex layers of a planar set
• The prize collecting traveling salesman problem
• Computational Geometry in C
• The complexity of computing minimum separating polygons
• Triangle-Based Heuristics for Area Optimal Polygonizations
• Fast fencing
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

This page was built for publication: Exact and heuristic solutions for the prize‐collecting geometric enclosure problem