Finding non-dominated solutions in bi-objective integer network flow problems
From MaRDI portal
Publication:1010260
DOI10.1016/J.COR.2008.11.001zbMATH Open1179.90049OpenAlexW2053678873MaRDI QIDQ1010260FDOQ1010260
Authors: A. Eusébio, José Rui Figueira 
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.001
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
efficient solutionsnon-dominated solutionsnetwork simplex algorithmbi-objective integer network flows
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Multicriteria Optimization
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- The biobjective minimum cost flow problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple objective minimum cost flow problems: a review
- Analysis of the objective space in multiple objective linear programming
- A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- Bicriteria network flow problems: Integer case
- An algorithm for the biobjective integer minimum cost flow problem
- Title not available (Why is that?)
- An alternative method to solve the biobjective minimum cost flow problem
- An efficient implementation of the network simplex method
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- Bicriteria network flow problems: Continuous case
- Efficient solutions for the bicriteria network flow problem
- Title not available (Why is that?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Title not available (Why is that?)
Cited In (15)
- 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
- Efficient automated schematic map drawing using multiobjective mixed integer programming
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Mean‐standard deviation model for minimum cost flow problem
- On the computation of all supported efficient solutions in 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
Uses Software
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)
