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

DOI10.1016/J.COR.2010.03.005MaRDI QIDQ991376zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• scientific article; zbMATH DE number 1870079
• Column generation approach for the point-feature cartographic label placement problem
• A clustering search metaheuristic for the point-feature cartographic label placement problem
• A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem
• Models and methods for cartographic label placement
• Optimal labeling of point features in rectangular labeling models
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling

Cites work

• scientific article; zbMATH DE number 1870079 (Why is no real title available?)
• A Decomposition Method for Quadratic Zero-One Programming
• A branch-and-price approach for the maximum weight independent set problem
• Column generation approach for the point-feature cartographic label placement problem
• Conflict graphs in solving integer programming problems
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• Lagrangean relaxation. (With comments and rejoinder).
• Lagrangean/surrogate relaxation for generalized assignment problems
• On the facial structure of set packing polyhedra
• Optimal labeling of point features in rectangular labeling models
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions
• POPMUSIC for the point feature label placement problem
• Placing Text Labels on Maps and Diagrams using Genetic Algorithms with Masking
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Three rules suffice for good label placement

Cited in

(9)

• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints
• A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem
• Exact and heuristic solution approaches for the generalized independent set problem
• Models and methods for cartographic label placement
• Column generation approach for the point-feature cartographic label placement problem
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling
• scientific article; zbMATH DE number 1696650 (Why is no real title available?)
• A clustering search metaheuristic for the point-feature cartographic label placement problem

Describes a project that uses

Uses Software

• CPLEX
• POPMUSIC

This page was built for publication: A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991376)