A discussion of scalarization techniques for multiple objective integer programming
From MaRDI portal
(Redirected from Publication:2379880)
Recommendations
- scientific article; zbMATH DE number 2159088
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Integer programming duality in multiple objective programming
- A combined scalarizing method for multiobjective programming problems
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
Cites work
- scientific article; zbMATH DE number 3934760 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1738108 (Why is no real title available?)
- scientific article; zbMATH DE number 2159088 (Why is no real title available?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Constructing robust crew schedules with bicriteria optimization
- Existence of efficient solutions for vector maximization problems
- Finding all efficient extreme points for multiple objective linear programs
- Integer programming duality in multiple objective programming
- Linear multiple objective programs with zero–one variables
- Note on combinatorial optimization with max-linear objective functions
- On Computing an Initial Efficient Extreme Point
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Robust discrete optimization and its applications
- The matroidal knapsack: A class of (often) well-solvable problems
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Unified interactive multiple objective programming
Cited in
(47)- Optimization of a linear function over an integer efficient set
- Efficient fair principal component analysis
- 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
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- Optimization of a quadratic programming problem over an Integer efficient set
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- scientific article; zbMATH DE number 2159088 (Why is no real title available?)
- Constrained optimization using multiple objective programming
- Dominance for multi-objective robust optimization concepts
- Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market
- Optimising a nonlinear utility function in multi-objective integer programming
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Visualizing data as objects by DC (difference of convex) optimization
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- The \(L\)-shape search method for triobjective integer programming
- Bi-objective design-for-control of water distribution networks with global bounds
- Relaxations and duality for multiobjective integer programming
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology
- Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage
- Nondominated Nash points: application of biobjective mixed integer programming
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A review of multiobjective programming and its application in quantitative psychology
- Network Models for Multiobjective Discrete Optimization
- Aggregation with dependencies: capacities and fuzzy integrals
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches
- A data-driven approach for supply chain network design under uncertainty with consideration of social concerns
- Clustering and portfolio selection problems: a unified framework
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
- Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A multiple criteria ranking method based on game cross-evaluation approach
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- A new conceptual framework for the therapy by optimized multidimensional pulses of therapeutic activity. The case of multiple myeloma model
This page was built for publication: A discussion of scalarization techniques for multiple objective integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379880)
