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

DOI10.1016/j.cor.2014.02.009zbMath1348.90154OpenAlexW1972684435MaRDI QIDQ337035

Matthias Ehrgott, José Rui Figueira, Augusto 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (19)

A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Computing representations using hypervolume scalarizations ⋮ 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 ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Discrete representation of non-dominated sets in multi-objective linear programming ⋮ Discrete representation of the non-dominated set for multi-objective optimization problems using kernels ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ 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 ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach

Cites Work

• On the quality of discrete representations in multiple objective programming
• Multiple objective minimum cost flow problems: a review
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Finding non-dominated solutions in bi-objective integer network flow problems
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• Approximation methods in multiobjective programming
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finding representative non-dominated points for bi-objective integer network flow problems