The following pages link to (Q5692464):
Displaying 50 items.
- A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
- A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives (Q319921) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Biobjective optimization for analytical target cascading: optimality vs. achievability (Q381921) (← links)
- A numerical method for constructing the Pareto front of multi-objective optimization problems (Q390465) (← links)
- A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Using multiobjective mathematical programming to link national competitiveness, productivity, and innovation (Q513109) (← 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)
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains (Q513645) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning (Q953293) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
- Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
- Improved \(\varepsilon\)-constraint method for multiobjective programming (Q1014011) (← links)
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems (Q1029383) (← links)
- A primal-dual simplex algorithm for bi-objective network flow problems (Q1041407) (← links)
- Tradeoff-based decomposition and decision-making in multiobjective programming (Q1042253) (← links)
- Multiobjective linguistic optimization (Q1582671) (← links)
- A fuzzy optimization approach for procurement transport operational planning in an automobile supply chain (Q1634169) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
- Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
- Comparison of some scalarization methods in multiobjective optimization (Q2272601) (← links)
- Multiobjective programming with new invexities (Q2377210) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- A conic scalarization method in multi-objective optimization (Q2392759) (← links)
- A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
- Multiobjective blockmodeling for social network analysis (Q2442107) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Primal-dual simplex method for multiobjective linear programming (Q2471113) (← links)
- Two-group classification via a biobjective margin maximization model (Q2497257) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- Multiobjective programming in optimization of the interval objective function (Q2639774) (← links)
- Technical Note—On Reconciling Conflicting Goals: Applications of Multiobjective Programming (Q3313643) (← links)
- (Q3444967) (← links)
- Introducing Nonpolyhedral Cones to Multiobjective Programming (Q3649588) (← links)
- Clasification en programacion multiobjetivo (Q3812026) (← links)
- (Q4387167) (← links)
- (Q4387240) (← links)
