Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization

DOI10.1016/j.cor.2011.09.006zbMath1251.90312OpenAlexW2088968016MaRDI QIDQ1761116

Marta M. B. Pascoal, Leizer Lima Pinto, Nelson F. Maculan, Cláudio Thomás Bornstein

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.006

zbMATH Keywords

Pareto-optimal solutionbottleneck functionmulticriteria combinatorial optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (4)

Bicriteria path problem minimizing the cost and minimizing the number of labels ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Enhanced two-step method via relaxed order of \(\boldsymbol{\alpha}\)-satisfactory degrees for fuzzy multiobjective optimization ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Generalized multiple objective bottleneck problems
• On a special class of bicriterion path problems
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
• The tricriterion shortest path problem with at least two bottleneck objective functions
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• The Constrained Bottleneck Problem in Networks
• Two Algorithms for Generating Weighted Spanning Trees in Order

This page was built for publication: Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization