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

Recommendations

An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
An exact algorithm for biobjective integer programming problems
An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
Improved -constraint method for multiobjective programming

Cites work

scientific article; zbMATH DE number 4010155 (Why is no real title available?)
scientific article; zbMATH DE number 4085440 (Why is no real title available?)
scientific article; zbMATH DE number 2160609 (Why is no real title available?)
scientific article; zbMATH DE number 1416629 (Why is no real title available?)
A bi-criteria approach for the data association problem
A criterion space search algorithm for biobjective integer programming: the balanced box method
A discussion of scalarization techniques for multiple objective integer programming
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
An algorithm for the bi-criterion integer programming problem
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
An improved algorithm for solving biobjective integer programs
An interactive method for bicriteria integer programming
An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
Constructing robust crew schedules with bicriteria optimization
Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
Finding representative systems for discrete bicriterion optimization problems
Improved -constraint method for multiobjective programming
Multi-objective integer programming: a general approach for generating all non-dominated solutions
Multicriteria Optimization
Multiobjective programming and planning
Multiple criteria decision analysis. State of the art surveys
Multi‐objective combinatorial optimization problems: A survey
Network and discrete location. Models, algorithms, and applications
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
Pyramidal tours and multiple objectives
Some heuristic methods for solving p-median problems with a coverage constraint
Three algorithms for bicriteria integer linear programs

Cited in

(3)

An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets

Describes a project that uses

Uses Software

MENU-OKF
MOD-DIST
SITATION
XPRESS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750397)