Bicriteria network flow problems: Integer case
From MaRDI portal
Publication:1207067
DOI10.1016/0377-2217(93)90213-7zbMath0780.90040OpenAlexW2065305730MaRDI QIDQ1207067
Publication date: 3 May 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90213-7
Integer programming (90C10) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (18)
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Multiple objective minimum cost flow problems: a review ⋮ 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 ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ Efficient solutions for the bicriteria network flow problem ⋮ An algorithm for the biobjective integer minimum cost flow problem ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems
Cites Work
- Unnamed Item
- An algorithm for the bi-criterion integer programming problem
- Interactive solutions for the linear multiobjective transportation problem
- An algorithm for the multiple objective integer linear programming problem
- Bicriteria network flow problems: Continuous case
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriteria Transportation Problem
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
This page was built for publication: Bicriteria network flow problems: Integer case
