Solving a large scale districting problem: A case report (Q1112735): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(88)90048-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021733698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Political Districting by Implicit Enumeration Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turfing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sales Territory Alignment: A Review and Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Models for Sales Resource Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transportation-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal transportation and transshipment algorithms / rank
 
Normal rank

Latest revision as of 10:14, 19 June 2024

scientific article
Language Label Description Also known as
English
Solving a large scale districting problem: A case report
scientific article

    Statements

    Solving a large scale districting problem: A case report (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The paper deals with the problem of defining the territories for 168 sales agents of a German manufacturer of consumer goods. About 1400 postal areas constitute the basic geographical units. The problem is solved by means of a location-allocation approach involving a standard code of primal network algorithm as well as a new heuristic for resolving split areas. Numerical results and the implementation of the procedure as a planning tool are presented.
    0 references
    large scale districting
    0 references
    location-allocation approach
    0 references
    primal network algorithm
    0 references
    heuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references