Numerical analysis of algorithms for solving bicriteria discrete programming problems
From MaRDI portal
The authors present results of numerical analysis of algorithms for solving a bicriteria assignment, spanning tree, and traveling salesman problems. All the algorithms under consideration are based on the linear convolution of criteria. Dependence of the number of effective points found by algorithms on the length of the partitioning interval is analyzed.
Recommendations
- Algorithms for nonlinear integer bicriterion problems
- An algorithm for the bi-criterion integer programming problem
- scientific article; zbMATH DE number 35514
- scientific article; zbMATH DE number 4049388
- Numerical solution of bilinear programming problems
- Algorithm robust for the bicriteria discrete optimization problem
- Numerical solution of a class of bilevel programming problems
- Bicriteria integer quadratic programming problems
- scientific article; zbMATH DE number 3858877
- An algorithm for solving a class of discrete multicriterion problems
Cited in
(5)- Algorithms for nonlinear integer bicriterion problems
- Bicriteria assignment problems: Complexity estimates and solution algorithms
- Numerical analysis of tricriteria tree and assignment problems
- The linear convolution of criteria in the bicriteria traveling salesman problem
- scientific article; zbMATH DE number 3926631 (Why is no real title available?)
This page was built for publication: Numerical analysis of algorithms for solving bicriteria discrete programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608267)
