Finding non-dominated solutions in bi-objective integer network flow problems
From MaRDI portal
Recommendations
- On finding representative non-dominated points for bi-objective integer network flow problems
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- An algorithm for the biobjective integer minimum cost flow problem
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- Finding non-dominated solutions for bi-objective integer transportation problem
Cites work
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 3845309 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1738336 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- An algorithm for the biobjective integer minimum cost flow problem
- An alternative method to solve the biobjective minimum cost flow problem
- An efficient implementation of the network simplex method
- Analysis of the objective space in multiple objective linear programming
- Bicriteria network flow problems: Continuous case
- Bicriteria network flow problems: Integer case
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Efficient solutions for the bicriteria network flow problem
- Multicriteria Optimization
- Multiple objective minimum cost flow problems: a review
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- The biobjective minimum cost flow problem
Cited in
(17)- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Finding integer efficient solutions for multiple objective network programming problems
- Finding non-dominated solutions for bi-objective integer transportation problem
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- On finding representative non-dominated points for bi-objective integer network flow problems
- Output-sensitive complexity of multi-objective integer network flow problems
- Efficient automated schematic map drawing using multiobjective mixed integer programming
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- Mean‐standard deviation model for minimum cost flow problem
- An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
- A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
This page was built for publication: Finding non-dominated solutions in bi-objective integer network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010260)
