A capacitated general routing problem on mixed networks

DOI10.1016/0305-0548(94)00035-7zbMath0830.90043OpenAlexW2081417526MaRDI QIDQ1894722

Ram Pandit, Balaji Muralidharan

Publication date: 24 July 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00035-7

zbMATH Keywords

routingcapacitated general routing problempartition-first-and-route-nextroute-first-partition-nextspecified segments of a mixed network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (7)

The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

Cites Work

• Unnamed Item
• A parallel insert method for the capacitated arc routing problem
• Network generation using the Prufer code
• Approximate solutions for the capacitated arc routing problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• An additive bounding procedure for the asymmetric travelling salesman problem
• Microcomputer-based vehicle routing and scheduling software
• Augment-insert algorithms for the capacitated arc routing problem
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• The Chinese Postman Problem for Mixed Networks
• Implementing vehicle routing algorithms
• On general routing problems
• On general routing problems: Comments
• A fundamental problem in vehicle routing
• Approximation Algorithms for Some Postman Problems
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A capacitated general routing problem on mixed networks