Finding shortest and dissimilar paths

DOI10.1111/itor.13060OpenAlexW3202476543MaRDI QIDQ6071084

Marta M. B. Pascoal, Maria Teresa Godinho, Ali Moghanni

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11311/1204634

zbMATH Keywords

costdissimilaritybiobjective optimizationinteger programming formulations\(K\) alternative paths

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-dissimilar vehicle routing problem
• The mixed capacitated arc routing problem with non-overlapping routes
• On finding dissimilar Pareto-optimal paths
• A comparison of solution strategies for biobjective shortest path problems
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Multiobjective programming and planning
• A bi-objective approach to discrete cost-bottleneck location problems
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A heuristic approach to the overnight security service problem
• On finding dissimilar paths
• The multiple shortest path problem with path deconfliction
• Modeling of Transport Risk for Hazardous Materials
• Multi‐objective combinatorial optimization problems: A survey
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• On a relaxed maximally disjoint path pair problem: a bicriteria approach

This page was built for publication: Finding shortest and dissimilar paths