On finding representative non-dominated points for bi-objective integer network flow problems

DOI10.1016/J.COR.2014.02.009zbMATH Open1348.90154OpenAlexW1972684435MaRDI QIDQ337035FDOQ337035

Authors: Matthias Ehrgott, José Rui Figueira, A. Eusébio 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.009

Recommendations

• Finding non-dominated solutions in bi-objective integer network flow problems
• Representation of the non-dominated set in biobjective discrete optimization
• An algorithm for the biobjective integer minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• On the computation of all supported efficient solutions in multi-objective integer network flow problems

zbMATH Keywords

integer programmingrepresentationnetwork optimisation\(\epsilon\)-constraint methodmulti-objective optimisationbi-objective network flow problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Integer programming (90C10)

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?)
• Title not available (Why is that?)
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Approximation methods in multiobjective programming
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Finding non-dominated solutions in bi-objective integer network flow problems
• Multiple objective minimum cost flow problems: a review
• Title not available (Why is that?)
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A correction to the connectedness of the evans-steuer algorithm of multiple objective linear programming
• On the quality of discrete representations in multiple objective programming
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh

Cited In (21)

• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
• Solving biobjective network flow problem associated with minimum cost-time loading
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
• Discrete representation of non-dominated sets in multi-objective linear programming
• Finding representations for an unconstrained bi-objective combinatorial optimization problem
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
• Biobjective robust optimization over the efficient set for Pareto set reduction
• Representation of the non-dominated set in biobjective discrete optimization
• Mean‐standard deviation model for minimum cost flow problem
• Finding non-dominated solutions in bi-objective integer network flow problems
• A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
• Computing representations using hypervolume scalarizations
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors

This page was built for publication: On finding representative non-dominated points for 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 Q337035)