Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
type: Item
instance of: scholarly article
title: Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
zbMATH Open document ID: 1397.90353
author: Jesús Sáez-Aguado
author: Paula Camelia Trandafir
published in: Mathematical Methods of Operations Research
publication date: 2018-05-18T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6870713
zbMATH Keywords: biobjective integer programming
zbMATH Keywords: epsilon-constraint method
zbMATH Keywords: \(p\)-median-cover problem
describes a project that uses: XPRESS
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
full work available at URL: s00186-017-0618-9
OpenAlex ID: W2766833744
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: A criterion space search algorithm for biobjective integer programming: the balanced box method
cites work: An algorithm for the bi-criterion integer programming problem
cites work: Q3760254
cites work: Multiobjective programming and planning
cites work: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
cites work: Network and discrete location. Models, algorithms, and applications
cites work: Multicriteria Optimization
cites work: A discussion of scalarization techniques for multiple objective integer programming
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Q4670576
cites work: Improved \(\varepsilon\)-constraint method for multiobjective programming
cites work: Constructing robust crew schedules with bicriteria optimization
cites work: Multiple criteria decision analysis. State of the art surveys
cites work: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
cites work: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
cites work: Finding representative systems for discrete bicriterion optimization problems
cites work: A bi-criteria approach for the data association problem
cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
cites work: Q4943600
cites work: Three algorithms for bicriteria integer linear programs
cites work: Pyramidal tours and multiple objectives
cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions
cites work: An improved algorithm for solving biobjective integer programs
cites work: An interactive method for bicriteria integer programming
cites work: Some heuristic methods for solving \(p\)-median problems with a coverage constraint
cites work: Q3815146
cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
cites work: Multi‐objective combinatorial optimization problems: A survey
DOI: 10.1007/S00186-017-0618-9
description: scientific article; zbMATH DE number 6870713