Finding representative systems for discrete bicriterion optimization problems
From MaRDI portal
Publication:2467474
DOI10.1016/J.ORL.2006.03.019zbMath1169.90443OpenAlexW1980012026MaRDI QIDQ2467474
Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.03.019
approximationefficient solutionmulticriteria optimizationquality measuresrepresentative systemsbox algorithm
Related Items (43)
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ A bi-objective approach to discrete cost-bottleneck location problems ⋮ Multiobjective portfolio optimization: bridging mathematical theory with asset management practice ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method ⋮ A hybrid approach for biobjective optimization ⋮ On the quality of discrete representations in multiple objective programming ⋮ An exact algorithm for biobjective integer programming problems ⋮ Computing representations using hypervolume scalarizations ⋮ A two-stage approach for bi-objective integer linear programming ⋮ Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Robust generalized Merton-type financial portfolio models with generalized utility ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Generating equidistant representations in biobjective programming ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives ⋮ IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection ⋮ Equity portfolio construction and selection using multiobjective mathematical programming ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics ⋮ 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 ⋮ Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ Comments on: ``Static and dynamic source locations in undirected networks ⋮ Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ Comparative issues between linear and non-linear risk measures for non-convex portfolio optimization: evidence from the S&P 500 ⋮ A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple objective minimum cost flow problems: a review
- A method for convex curve approximation
- Efficient approximate representation of bi-objective tradeoff sets
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Unbiased approximation in multicriteria optimization
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Multiple criteria decision analysis. State of the art surveys
- Algorithm robust for the bicriteria discrete optimization problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximation methods in multiobjective programming
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- An interactive rectangle elimination method for biobjective decision making
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Multicriteria Optimization
This page was built for publication: Finding representative systems for discrete bicriterion optimization problems
