Modeling and solving the mixed capacitated general routing problem (Q375984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FEASPUMP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CBMix / 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/s11590-012-0552-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083681781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / 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: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the general routing 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: A branch & cut algorithm for the windy general routing problem and special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Arc Routing Problems: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed general routing polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / 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: Q4821580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inequalities for the general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general routing polyhedron: A unifying framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental problem in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacitated general routing problem on mixed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming arc routing into node routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the capacitated arc routing problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:42, 7 July 2024

scientific article
Language Label Description Also known as
English
Modeling and solving the mixed capacitated general routing problem
scientific article

    Statements

    Modeling and solving the mixed capacitated general routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 November 2013
    0 references
    routing problem
    0 references
    mixed graph
    0 references
    relaxation
    0 references
    separation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers