Pages that link to "Item:Q2467474"

The following pages link to Finding representative systems for discrete bicriterion optimization problems (Q2467474):

Displaying 41 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• On the quality of discrete representations in multiple objective programming (Q374696) (← links)
• Generating equidistant representations in biobjective programming (Q429518) (← links)
• Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives (Q519662) (← links)
• IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection (Q531474) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• Equity portfolio construction and selection using multiobjective mathematical programming (Q975768) (← links)
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems (Q1029383) (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• Multiobjective portfolio optimization: bridging mathematical theory with asset management practice (Q1615977) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
• Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics (Q2029268) (← links)
• Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches (Q2108816) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method (Q2163842) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
• A two-stage approach for bi-objective integer linear programming (Q2417052) (← links)
• Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds (Q2514721) (← links)
• An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) (← links)
• A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966288) (← links)
• Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm (Q6068711) (← links)
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
• Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
• An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) (← links)
• Robust generalized Merton-type financial portfolio models with generalized utility (Q6148775) (← links)
• Optimising makespan and energy consumption in task scheduling for parallel systems (Q6164588) (← links)
• An exact criterion space search algorithm for a bi-objective blood collection problem (Q6168602) (← links)