Pages that link to "Item:Q1575074"
From MaRDI portal
The following pages link to Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming (Q1575074):
Displaying 50 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- On the worst-case optimal multi-objective global optimization (Q395864) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes (Q681288) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- A regression study of the number of efficient extreme points in multiple objective linear programming (Q706929) (← links)
- Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems (Q709108) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Implicit enumeration strategies for the hypervolume subset selection problem (Q1782182) (← links)
- The controlled estimation method in the multiobjective linear fractional problem (Q1885953) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
- Performance indicators in multiobjective optimization (Q2030589) (← links)
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization (Q2044473) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Decision space robustness for multi-objective integer linear programming (Q2108813) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- A radial boundary intersection aided interior point method for multi-objective optimization (Q2282318) (← links)
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- Equispaced Pareto front construction for constrained bi-objective optimization (Q2450442) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)
- Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization (Q2678998) (← links)
- An approximation to the nondominated set of a multiobjective linear fractional programming problem (Q2817230) (← links)
- A genetic algorithm for a bicriteria supplier selection problem (Q3393984) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966288) (← links)
