Bicriteria network flow problems: Integer case
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3891122 (Why is no real title available?)
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriteria Transportation Problem
- Bicriteria network flow problems: Continuous case
- Interactive solutions for the linear multiobjective transportation problem
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
Cited in
(25)- Bicriteria network flow problems: Continuous case
- Finding integer efficient solutions for multiple objective network programming problems
- scientific article; zbMATH DE number 3845309 (Why is no real title available?)
- Efficient solutions for the bicriteria network flow problem
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An improved algorithm for solving biobjective integer programs
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Integer version of the multipath flow network synthesis problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Using mathematical programming heuristics in a multicriteria network flow context
- The biobjective undirected two-commodity minimum cost flow problem
- Multiple objective minimum cost flow problems: a review
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
- Algorithm robust for the bicriteria discrete optimization problem
- Bicriterion discrete equilibrium network design problem
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- Two phase algorithms for the bi-objective assignment problem
- An algorithm for the biobjective integer minimum cost flow problem
- scientific article; zbMATH DE number 1819781 (Why is no real title available?)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A generalized bi-criteria fuzzy integer flow sharing problem
- A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
This page was built for publication: Bicriteria network flow problems: Integer case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207067)
