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

DOI10.1007/s00186-017-0618-9zbMath1397.90353OpenAlexW2766833744MaRDI QIDQ1750397

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

Publication date: 18 May 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-017-0618-9

zbMATH Keywords

epsilon-constraint method\(p\)-median-cover problembiobjective integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (1)

An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems

Uses Software

• XPRESS
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
• Pyramidal tours and multiple objectives
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• An algorithm for the bi-criterion integer programming problem
• Multiobjective programming and planning
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Three algorithms for bicriteria integer linear programs
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Multiple criteria decision analysis. State of the art surveys
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint
• An improved algorithm for solving biobjective integer programs
• A bi-criteria approach for the data association problem
• A discussion of scalarization techniques for multiple objective integer programming
• Finding representative systems for discrete bicriterion optimization problems
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• An interactive method for bicriteria integer programming
• Constructing robust crew schedules with bicriteria optimization
• Multi‐objective combinatorial optimization problems: A survey
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems