Multi-objective integer programming: a general approach for generating all non-dominated solutions
From MaRDI portal
Publication:1042091
Recommendations
- Multi-objective integer programming: an improved recursive algorithm
- Finding all nondominated points of multi-objective integer programs
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
Cites work
- 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 method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An algorithm for the multiple objective integer linear programming problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Integer programming duality in multiple objective programming
- Multiple criteria optimization: State of the art annotated bibliographic surveys
Cited in
(65)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- Optimizing a linear function over the nondominated set of multiobjective integer programs
- Optimising a nonlinear utility function in multi-objective integer programming
- Finding integer efficient solutions for multiple objective network programming problems
- Disjunctive Programming for Multiobjective Discrete Optimisation
- A bi-objective model for the location of landfills for municipal solid waste
- 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
- Solution approaches for equitable multiobjective integer programming problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- A new complexity result on multiobjective linear integer programming using short rational generating functions
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- An extension of the non-inferior set estimation algorithm for many objectives
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- Dynamic rerouting of vehicles during cooperative wildfire response operations
- Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- Generating Multiple Solutions for Mixed Integer Programming Problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Finding all nondominated points of multi-objective integer programs
- On nadir points of multiobjective integer programming problems
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- Network Models for Multiobjective Discrete Optimization
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
- Multi-objective integer programming: an improved recursive algorithm
- A discussion of scalarization techniques for multiple objective integer programming
- An interactive approximation algorithm for multi-objective integer programs
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- On the representation of the search region in multi-objective optimization
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A multi-criteria approach for hospital capacity analysis
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Finding a representative nondominated set for multi-objective mixed integer programs
- Distribution based representative sets for multi-objective integer programs
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- A new hybrid intelligent algorithm for fuzzy multiobjective programming problem based on credibility theory
- An exact algorithm for biobjective mixed integer linear programming problems
- The \(L\)-shape search method for triobjective integer programming
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems
- Computing the nadir point for multiobjective discrete optimization problems
- Optimization of a linear function over an integer efficient set
- General method for solving multi-objective de novo programming problem
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- Identifying efficient solutions in multiple objective integer monotone programs
- Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation
- Optimization of a quadratic programming problem over an Integer efficient set
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- An exact method to generate all nondominated spanning trees
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
- Designing sustainable diet plans by solving triobjective integer programs
This page was built for publication: Multi-objective integer programming: a general approach for generating all non-dominated solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042091)
