Graphical-structure-based models for routing problems

DOI10.1080/00207728808964068zbMath0653.90034OpenAlexW2158407149MaRDI QIDQ3799805

Agha Iqbal Ali, Chung-Hsing Huang

Publication date: 1988

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728808964068

zbMATH Keywords

routingbalance constraintsconservation of flowgraphical-structure-based modelshierarchical development

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies

Cites Work

• Unnamed Item
• Balanced optimization problems
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• Complexity of spanning tree problems: Part I
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The complexity of restricted spanning tree problems
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Graphical-structure-based models for routing problems