Finding representative systems for discrete bicriterion optimization problems
From MaRDI portal
(Redirected from Publication:2467474)
Recommendations
- Representation of the non-dominated set in biobjective discrete optimization
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- On the quality of discrete representations in multiple objective programming
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
Cites work
- scientific article; zbMATH DE number 4160443 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- A method for convex curve approximation
- Algorithm robust for the bicriteria discrete optimization problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An interactive rectangle elimination method for biobjective decision making
- Approximation methods in multiobjective programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- Efficient approximate representation of bi-objective tradeoff sets
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Multiple objective minimum cost flow problems: a review
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- Unbiased approximation in multicriteria optimization
Cited in
(45)- Comments on: ``Static and dynamic source locations in undirected networks
- Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives
- A new approach to select the best subset of predictors in linear regression modelling: bi-objective mixed integer linear programming
- Bilevel programming for generating discrete representations in multiobjective optimization
- Robust generalized Merton-type financial portfolio models with generalized utility
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Finding representations for an unconstrained bi-objective combinatorial optimization problem
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Multiobjective portfolio optimization: bridging mathematical theory with asset management practice
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Comparative issues between linear and non-linear risk measures for non-convex portfolio optimization: evidence from the S&P 500
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- The \(L\)-shape search method for triobjective integer programming
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Exploring the trade-off between generalization and empirical errors in a one-norm SVM
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
- An exact criterion space search algorithm for a bi-objective blood collection problem
- Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics
- A two-stage approach for bi-objective integer linear programming
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- 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
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- Representation of the non-dominated set in biobjective discrete optimization
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A hybrid approach for biobjective optimization
- An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- On the quality of discrete representations in multiple objective programming
- Generating equidistant representations in biobjective programming
- Equity portfolio construction and selection using multiobjective mathematical programming
- IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection
- Representing the nondominated set in multi-objective mixed-integer programs
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
- Computing representations using hypervolume scalarizations
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An exact criterion space search method for a bi-objective nursing home location and allocation problem
- Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
- A bi-objective approach to discrete cost-bottleneck location problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- An exact algorithm for biobjective integer programming problems
This page was built for publication: Finding representative systems for discrete bicriterion optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467474)
