Output-sensitive complexity of multi-objective integer network flow problems
From MaRDI portal
Cites work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- A note on \(K\) best network flows
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
- 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 output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
- Finding integer efficient solutions for multiple objective network programming problems
- Finding non-dominated solutions in bi-objective integer network flow problems
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 3069634 (Why is no real title available?)
- Inductive Logic Programming
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- 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.
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On finding representative non-dominated points for bi-objective integer network flow problems
- On generating all maximal independent sets
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- Solving scalarized multi-objective network flow problems using an interior point method
- The biobjective minimum cost flow problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
This page was built for publication: Output-sensitive complexity of multi-objective integer network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845807)
