scientific article
From MaRDI portal
Publication:3802899
zbMath0655.90073MaRDI QIDQ3802899
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
classification schemeNP-completebiobjective shortest path problembiobjective assignment problembiobjective nondominant maximal elements of matroidsmatroid problemsmulti-objective combinatorial problems
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items (40)
An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ On bicriterion minimal spanning trees: An approximation ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ An improved multiobjective shortest path algorithm ⋮ Computing representations using hypervolume scalarizations ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Ordinal optimization through multi-objective reformulation ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ The Steiner bi-objective shortest path problem ⋮ Dynamic programming and minimum risk paths ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ The time-dependent vehicle routing problem with time windows and road-network information ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ Bi-objective matchings with the triangle inequality ⋮ On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ On efficiency of a single variable bi-objective optimization algorithm ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Implementing an efficient fptas for the 0-1 multi-objective knapsack problem ⋮ Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis ⋮ Approximation of convex curves with application to the bicriterial minimum cost flow problem ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
This page was built for publication:
