Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems

Sáez-Aguado, Jesús; Trandafir, Paula Camelia

doi:10.1007/s00186-017-0618-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Algorithms For Multiobjective Integer Optimization Problems1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sáez‐Aguado and Trandafir (2018) review the

ε

‐constraint method and its variants and discuss their corresponding complexity with respect to the number of integer programs to be solved. These methods require solving at least

∣ Y_{N} ∣ + 3

integer programs.…”

Section: Algorithms For Multiobjective Integer Optimization Problemsmentioning

confidence: 99%

Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey

Halffmann

Schäfer

Dächert

et al. 2022

Multi Criteria Decision Anal

View full text Add to dashboard Cite

We provide a comprehensive overview of the literature of algorithmic approaches for multiobjective mixed-integer and integer linear optimization problems. More precisely, we categorize and display exact methods for multiobjective linear problems with integer variables for computing the entire set of nondominated images. Our review lists 108 articles and is intended to serve as a reference for all researchers who are familiar with basic concepts of multiobjective optimization and who have an interest in getting a thorough view on the state-of-the-art in multiobjective mixedinteger programming.

show abstract

“…Sáez‐Aguado and Trandafir (2018) review the

ε

‐constraint method and its variants and discuss their corresponding complexity with respect to the number of integer programs to be solved. These methods require solving at least

∣ Y_{N} ∣ + 3

integer programs.…”

Section: Algorithms For Multiobjective Integer Optimization Problemsmentioning

confidence: 99%

Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey

Halffmann

Schäfer

Dächert

et al. 2022

Multi Criteria Decision Anal

View full text Add to dashboard Cite

show abstract

An ε-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems

Glize

Jozefowiez

Ngueveu

2022

Computers & Operations Research

View full text Add to dashboard Cite

Multi-objective collaborative assembly line design problem with the optimisation of ergonomics and economics

Abdous

Delorme

Battini

et al. 2022

International Journal of Production Research

View full text Add to dashboard Cite

Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems

Cited by 3 publications

References 22 publications

Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey

Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey

An ε-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems

Multi-objective collaborative assembly line design problem with the optimisation of ergonomics and economics

Contact Info

Product

Resources

About