A capacitated general routing problem on mixed networks (Q1894722): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Balaji Muralidharan / rank
Normal rank
 
Property / author
 
Property / author: Balaji Muralidharan / 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.1016/0305-0548(94)00035-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081417526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and vehicle routing for municipal waste collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel insert method for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Microcomputer-based vehicle routing and scheduling software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chinese Postman Problem for Mixed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing vehicle routing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augment-insert algorithms for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the capacitated 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: On general routing problems: Comments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An additive bounding procedure for the asymmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network generation using the Prufer code / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:53, 23 May 2024

scientific article
Language Label Description Also known as
English
A capacitated general routing problem on mixed networks
scientific article

    Statements

    A capacitated general routing problem on mixed networks (English)
    0 references
    0 references
    0 references
    24 July 1995
    0 references
    0 references
    capacitated general routing problem
    0 references
    routing
    0 references
    specified segments of a mixed network
    0 references
    route-first-partition-next
    0 references
    partition-first-and-route-next
    0 references
    0 references