Pages that link to "Item:Q1014011"

The following pages link to Improved \(\varepsilon\)-constraint method for multiobjective programming (Q1014011):

Displaying 37 items.

• A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
• A multi-criteria approach for hospital capacity analysis (Q323555) (← links)
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
• An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
• On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets (Q467443) (← links)
• A smoothing method for solving bilevel multiobjective programming problems (Q489158) (← links)
• An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
• Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm (Q721156) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
• Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming (Q832805) (← links)
• A multiple objective methodology for sugarcane harvest management with varying maturation periods (Q1615948) (← links)
• A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems (Q1670109) (← links)
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Whole blood or apheresis donations? A multi-objective stochastic optimization approach (Q1754076) (← links)
• A supply chain design problem with facility location and bi-objective transportation choices (Q1939103) (← 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)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Computationally efficient approach for solving lexicographic multicriteria optimization problems (Q2230779) (← links)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
• Multi-objective evolutionary algorithms for a reliability location problem (Q2286920) (← links)
• Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems (Q2356347) (← links)
• Interactive decision support in radiation therapy treatment planning (Q2481567) (← links)
• Linear fractional multi-objective optimization problems subject to fuzzy relational equations with a continuous Archimedean triangular norm (Q2629960) (← links)
• Improving the min-max method for multiobjective programming (Q2661504) (← links)
• A combined scalarization method for multi-objective optimization problems (Q2666683) (← links)
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization (Q2841152) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• The modified objective-constraint scalarization approach for multiobjective optimization problems (Q5870938) (← links)
• Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems (Q6046880) (← links)
• A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations (Q6066659) (← links)
• Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing (Q6106497) (← links)
• A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems (Q6192422) (← links)