A discussion of scalarization techniques for multiple objective integer programming
From MaRDI portal
Publication:2379880
DOI10.1007/s10479-006-0074-zzbMath1188.90236OpenAlexW2027360559MaRDI QIDQ2379880
Publication date: 23 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0074-z
Related Items (42)
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Dominance for multi-objective robust optimization concepts ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ 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 ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ A data-driven approach for supply chain network design under uncertainty with consideration of social concerns ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Constrained optimization using multiple objective programming ⋮ Optimization of a linear function over an integer efficient set ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Aggregation with dependencies: capacities and fuzzy integrals ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ 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 ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market ⋮ 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 ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ 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 ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ A multiple criteria ranking method based on game cross-evaluation approach ⋮ Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics ⋮ Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ Clustering and portfolio selection problems: a unified framework ⋮ Multi-objective integer programming: a general approach for generating all non-dominated solutions ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Efficient fair principal component analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The matroidal knapsack: A class of (often) well-solvable problems
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Existence of efficient solutions for vector maximization problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Unified interactive multiple objective programming
- Robust discrete optimization and its applications
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Note on combinatorial optimization with max-linear objective functions
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Integer programming duality in multiple objective programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Linear multiple objective programs with zero–one variables
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- Constructing robust crew schedules with bicriteria optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
This page was built for publication: A discussion of scalarization techniques for multiple objective integer programming
