The Solution of Large 0–1 Integer Programming Problems Encountered in Automated Cartography

Steven Zoraster
Additional contact information
Steven Zoraster: Zycor, Inc., Austin, Texas

Operations Research, 1990, vol. 38, issue 5, 752-759

Abstract: The placement of text on a map to maximize map legibility, while avoiding graphic overplotting, is a problem in combinatorial optimization. This particular optimization problem can be formulated as a multiple choice integer programming problem, and the integer programming problem has a structure that can be exploited, using a Lagrangian heuristic, to obtain a cost effective solution, even when tens of thousands of variables and thousands of constraints are involved. This paper presents the mathematical formulation of the map label placement problem and describes a computer program implemented to solve it.

Keywords: programming; integer; heuristic: automated cartography (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.752 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:5:p:752-759

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().