Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
From MaRDI portal
Publication:862814
DOI10.1007/s10288-005-0074-xzbMath1125.90405MaRDI QIDQ862814
Sabine Randriamasy, Xavier Gandibleux, Frédéric Beugnies
Publication date: 24 January 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0074-x
90C29: Multi-objective and goal programming
90B18: Communication networks in operations research
90C27: Combinatorial optimization
05C38: Paths and cycles
68M12: Network protocols
Related Items
Multicriteria path and tree problems: discussion on exact algorithms and applications, Generalized multiple objective bottleneck problems, An aggregate label setting policy for the multi-objective shortest path problem, An interactive algorithm for multi-objective route planning, Risk approaches for delivering disaster relief supplies, Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty, On algorithms for the tricriteria shortest path problem with two bottleneck objective functions, The tricriterion shortest path problem with at least two bottleneck objective functions, An evolutionary approach to generalized biobjective traveling salesperson problem, Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization, Uncertain programming models for multi-objective shortest path problem with uncertain parameters, Speeding up Martins' algorithm for multiple objective shortest path problems, An improved multiobjective shortest path algorithm, The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks, A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm, Hierarchical Multiobjective Shortest Path Problems, Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications
