An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing

DOI10.1016/J.COR.2019.02.004MaRDI QIDQ1734819zbMATH OpenOpenAlexFDO

Authors Kátia C. C. Fernandes, Kleber V. Cardoso, Leizer Lima Pinto, Nelson Maculan

Publication date 27 March 2019

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

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

zbMATH Keywords

\(\epsilon\)-constraint techniquebi-objective optimizationnetwork flow routing problempolynomial time

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Finding non-dominated solutions in bi-objective integer network flow problems
• On finding representative non-dominated points for bi-objective integer network flow problems
• Flow routing aiming load balancing and path length in multi-hop networks with different link qualities
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• An algorithm for the biobjective integer minimum cost flow problem

Cites work

• A bicriterion shortest path algorithm
• A discussion of scalarization techniques for multiple objective integer programming
• An algorithm for the bi-criterion integer programming problem
• An algorithm for the multiple objective integer linear programming problem
• Emergence of Scaling in Random Networks
• Finding all nondominated points of multi-objective integer programs
• scientific article; zbMATH DE number 5917374 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• Multi-objective integer programming: an improved recursive algorithm
• Multicriteria Optimization
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• Polynomial algorithms for a class of linear programs
• The \(L\)-shape search method for triobjective integer programming
• The Constrained Bottleneck Problem in Networks

Cited in

(5)

• On the computation of all supported efficient solutions in multi-objective integer network flow problems
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
• Flow routing aiming load balancing and path length in multi-hop networks with different link qualities
• Two-stage algorithm for bi-objective black-box traffic engineering

Describes a project that uses

Uses Software

• MOIP_AIRA
• BOCBLP

This page was built for publication: An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734819)