The equity constrained shortest path problem

DOI10.1016/0305-0548(90)90006-SzbMath0695.90099OpenAlexW2094169436MaRDI QIDQ910348

Ram Gopalan, Mark H. Karwan, Rajan Batta

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90006-s

zbMATH Keywords

labelingshortest pathLagrangean relaxationequality constraintsheuristicsubgradient algorithmLagrangean dual

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (10)

Equity measurement in facility location analysis: A review and framework ⋮ The maximin HAZMAT routing problem ⋮ Finding minimum and equitable risk routes for hazmat shipments ⋮ A tabu search approach for scheduling hazmat shipments ⋮ Generalized route planning model for hazardous material transportation with VaR and equity considerations ⋮ CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL ⋮ A routing and scheduling approach to rail transportation of hazardous materials with demand due dates ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique ⋮ A review of extensive facility location in networks

Cites Work

• Surrogate Dual Multiplier Search Procedures in Integer Programming
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• Utility Functions for Equity and Public Risk
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Iterative methods for determining the k shortest paths in a network
• Modeling Equity of Risk in the Transportation of Hazardous Materials
• Finding the K Shortest Loopless Paths in a Network
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: The equity constrained shortest path problem