An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
type: Item
instance of: scholarly article
title: An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
zbMATH Open document ID: 1430.90423
author: María Isabel Hartillo Hermoso
author: Haydee Jiménez-Tafur
author: J. M. Ucha
published in: European Journal of Operational Research
publication date: 2020-01-08T00:00:00Z
full work available at URL: https://idus.us.es/handle//11441/104592
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7148655
zbMATH Keywords: multiple objective programming
zbMATH Keywords: non-dominated set
zbMATH Keywords: Pareto set
zbMATH Keywords: \( \epsilon \)-constraint method
zbMATH Keywords: unbounded knapsack problem
zbMATH Keywords: algebraic test sets
describes a project that uses: NEOS
describes a project that uses: 4ti2
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2976023331
cites work: Solving efficiently the 0-1 multi-objective knapsack problem
cites work: A new algebraic geometry algorithm for integer programming
cites work: Partial Gröbner bases for multiobjective integer linear optimization
cites work: Some algebraic methods for solving multiobjective polynomial integer programs
cites work: The triangle splitting method for biobjective mixed integer programming
cites work: Speeding up many-objective optimization by Monte Carlo approximations
cites work: Using Algebraic Geometry
cites work: Algebraic and geometric ideas in the theory of discrete optimization
cites work: Multicriteria Optimization
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: Improved \(\varepsilon\)-constraint method for multiobjective programming
cites work: Q4421360
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
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: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
cites work: An improved algorithm for solving biobjective integer programs
cites work: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
cites work: Dynamic programming algorithms for the bi-objective integer knapsack problem
cites work: Q3818127
cites work: Q4861423
cites work: A Geometric Buchberger Algorithm for Integer Programming
cites work: Truncated Gröbner bases for integer programming
cites work: A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
DOI: 10.1016/J.EJOR.2019.09.032
Recommended article: An exact algorithm for biobjective integer programming problems
Recommended article: An exact algorithm for biobjective mixed integer linear programming problems
Recommended article: An improved algorithm for solving biobjective integer programs
Recommended article: Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
Recommended article: Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
description: scientific article; zbMATH DE number 7148655