Profitable mixed capacitated arc routing and related problems (Q2343077): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11750-014-0336-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028844056 / 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: A matheuristic for the team orienteering arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undirected capacitated arc routing problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed 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: Min-Max <i>K</i> -vehicles windy rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Mixed General Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the windy postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative formulations for a layout problem in the fashion industry / 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: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement Procedures for the Undirected Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bounded Cycle-Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the maximum benefit chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the undirected capacitated arc routing problem with profits / rank
 
Normal rank

Latest revision as of 00:33, 10 July 2024

scientific article
Language Label Description Also known as
English
Profitable mixed capacitated arc routing and related problems
scientific article

    Statements

    Profitable mixed capacitated arc routing and related problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    routing
    0 references
    arc routing problems
    0 references
    profits
    0 references
    flow-based models
    0 references
    0 references
    0 references

    Identifiers