Multiple objective minimum cost flow problems: a review
From MaRDI portal
Publication:853016
Recommendations
Cites work
- scientific article; zbMATH DE number 3845309 (Why is no real title available?)
- scientific article; zbMATH DE number 4160443 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- scientific article; zbMATH DE number 1783874 (Why is no real title available?)
- scientific article; zbMATH DE number 912664 (Why is no real title available?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A method for convex curve approximation
- A note on \(K\) best network flows
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- Algebraic flows in regular matroids
- An algorithm for the biobjective integer minimum cost flow problem
- An alternative method to solve the biobjective minimum cost flow problem
- An approach for the network flow problem with multiple objectives
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Bicriteria Transportation Problem
- 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
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Efficient solutions for the bicriteria network flow problem
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
- Multicriteria optimization
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multiple objective minimum cost flow problems: a review
- Multi‐objective combinatorial optimization problems: A survey
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- Proper efficiency and the theory of vector maximization
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Solving Bicriterion Mathematical Programs
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- The biobjective minimum cost flow problem
- The enumeration of all efficient solutions for a linear multiple-objective transportation problem
- Using mathematical programming heuristics in a multicriteria network flow context
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
Cited in
(21)- Finding integer efficient solutions for multiple objective network programming problems
- A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem
- Solving biobjective network flow problem associated with minimum cost-time loading
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Finding representative systems for discrete bicriterion optimization problems
- Mean‐standard deviation model for minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- A new method for solving single and multi-objective fuzzy minimum cost flow problems with different membership functions
- Multiple objective minimum cost flow problems: a review
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
- A primal-dual simplex algorithm for bi-objective network flow problems
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- A novel approach to subgraph selection with multiple weights on arcs
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- An approach for the network flow problem with multiple objectives
- Minimum cost multi-product flow lines
- On finding representative non-dominated points for bi-objective integer network flow problems
- A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
- Application of fuzzy minimum cost flow problems to network design under uncertainty
This page was built for publication: Multiple objective minimum cost flow problems: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853016)
