The generalized arc routing problem (Q1688441): 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.1007/s11750-017-0437-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2586457066 / rank
 
Normal rank
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: The generalized arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the profitable windy rural postman 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: The capacitated arc routing problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and heuristics for the windy rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Rural Postman problem on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing / 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: A branch-and-cut algorithm for the maximum benefit Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / 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: Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the undirected rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the close-enough arc routing problem / 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

Revision as of 21:38, 14 July 2024

scientific article
Language Label Description Also known as
English
The generalized arc routing problem
scientific article

    Statements

    The generalized arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2018
    0 references
    arc routing
    0 references
    polyhedral modeling
    0 references
    routing
    0 references
    facets
    0 references
    valid inequalities
    0 references
    mathematical programming
    0 references
    CPLEX
    0 references
    branch and cut
    0 references
    TSP
    0 references
    operations research
    0 references

    Identifiers