Pre-treatment of path problems with required lengths

DOI10.1080/09720529.2017.1392451OpenAlexW2776102956MaRDI QIDQ5070029

Hui Yang, Wang-Hai Zhu

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

simplificationoperational researchpath modelpath problem with required length

Mathematics Subject Classification ID

Cites Work

• Exact methods for solving the elementary shortest and longest path problems
• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• The multi-stripe travelling salesman problem
• Generalized zeon algebras: theory and application to multi-constrained path problems
• Nonlinear neural networks for solving the shortest path problem
• Minimax regret vertex 2-sink location problem in dynamic path networks

This page was built for publication: Pre-treatment of path problems with required lengths