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

DOI10.1016/j.cor.2019.02.004zbMath1458.90581OpenAlexW2914006578MaRDI QIDQ1734819

Kleber V. Cardoso, Kátia C. C. Fernandes, Leizer Lima Pinto, Nelson F. 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

polynomial timebi-objective optimization\(\epsilon\)-constraint techniquenetwork flow routing problem

Mathematics Subject Classification ID

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

Related Items (1)

Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs

Uses Software

• MOIP_AIRA
• BOCBLP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(L\)-shape search method for triobjective integer programming
• Finding all nondominated points of multi-objective integer programs
• An algorithm for the bi-criterion integer programming problem
• An algorithm for the multiple objective integer linear programming problem
• A bicriterion shortest path algorithm
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• Multi-objective integer programming: an improved recursive algorithm
• A discussion of scalarization techniques for multiple objective integer programming
• Emergence of Scaling in Random Networks
• The Constrained Bottleneck Problem in Networks
• Polynomial algorithms for a class of linear programs
• Multicriteria Optimization

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