A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem

DOI10.1016/j.cor.2010.03.005zbMath1231.90269OpenAlexW2155332641MaRDI QIDQ991376

Glaydston M. Ribeiro, Geraldo Regis Mauri, Luiz Antonio Nogueira Lorena

Publication date: 7 September 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.005

zbMATH Keywords

combinatorial optimizationLagrangean decompositionlabel placement

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items

A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem, Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints, A clustering search metaheuristic for the point-feature cartographic label placement problem

Uses Software

• CPLEX
• POPMUSIC

Cites Work

• Unnamed Item
• Unnamed Item
• POPMUSIC for the point feature label placement problem
• Optimal labeling of point features in rectangular labeling models
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangean relaxation. (With comments and rejoinder).
• Conflict graphs in solving integer programming problems
• Column generation approach for the point-feature cartographic label placement problem
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• Placing Text Labels on Maps and Diagrams using Genetic Algorithms with Masking
• A Decomposition Method for Quadratic Zero-One Programming
• On the facial structure of set packing polyhedra
• The Traveling-Salesman Problem and Minimum Spanning Trees
• A branch-and-price approach for the maximum weight independent set problem
• Three rules suffice for good label placement