Variants of the -constraint method for biobjective integer programming problems: application to p-median-cover problems
From MaRDI portal
Publication:1750397
DOI10.1007/S00186-017-0618-9zbMATH Open1397.90353OpenAlexW2766833744MaRDI QIDQ1750397FDOQ1750397
Authors: 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
Recommendations
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- An exact \(\epsilon\)-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 \(\varepsilon\)-constraint method for multiobjective programming
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Multiple criteria decision analysis. State of the art surveys
- Title not available (Why is that?)
- Multicriteria Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Pyramidal tours and multiple objectives
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- 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
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A discussion of scalarization techniques for multiple objective integer programming
- Finding representative systems for discrete bicriterion optimization problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Multi‐objective combinatorial optimization problems: A survey
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- An improved algorithm for solving biobjective integer programs
- Network and discrete location. Models, algorithms, and applications
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Constructing robust crew schedules with bicriteria optimization
- An interactive method for bicriteria integer programming
- Three algorithms for bicriteria integer linear programs
- A bi-criteria approach for the data association problem
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
Uses Software
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)
