Multi-objective integer programming: a general approach for generating all non-dominated solutions
From MaRDI portal
Publication:1042091
DOI10.1016/j.ejor.2008.10.023zbMath1176.90554OpenAlexW2051251127WikidataQ58644696 ScholiaQ58644696MaRDI QIDQ1042091
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://rmit-researchmanagement.esploro.exlibrisgroup.com/view/delivery/61RMIT_INST/12248350340001341/13248382920001341
Related Items
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ On the representation of the search region in multi-objective optimization ⋮ A multi-criteria approach for hospital capacity analysis ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ Dynamic rerouting of vehicles during cooperative wildfire response operations ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ On nadir points of multiobjective integer programming problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Optimization of a linear function over an integer efficient set ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ An exact method to generate all nondominated spanning trees ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Multiobjective integer nonlinear fractional programming problem: a cutting plane approach ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches ⋮ A mathematical programming approach to the computation of the omega invariant of a numerical semigroup ⋮ Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ A new hybrid intelligent algorithm for fuzzy multiobjective programming problem based on credibility theory ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ A bi-objective model for the location of landfills for municipal solid waste ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ An extension of the non-inferior set estimation algorithm for many objectives ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Computing the nadir point for multiobjective discrete optimization problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- An algorithm for the multiple objective integer linear programming problem
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- 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
- Integer programming duality in multiple objective programming
- A discussion of scalarization techniques for multiple objective integer programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
