The undirected capacitated general routing problem with profits (Q1752868): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3159349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the prize-collecting rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privatized rural postman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated team orienteering and profitable tour problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the node, edge, and arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cycle polytope of a binary matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed capacitated general routing problem under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance constrained multiple vehicle traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase branch-and-cut for the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hot strip mill production scheduling problem: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank

Revision as of 16:30, 15 July 2024

scientific article
Language Label Description Also known as
English
The undirected capacitated general routing problem with profits
scientific article

    Statements

    The undirected capacitated general routing problem with profits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    general routing
    0 references
    profits
    0 references
    aggregate formulation
    0 references
    branch-and-cut
    0 references

    Identifiers

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