Pages that link to "Item:Q3343799"
From MaRDI portal
The following pages link to An Overview of Techniques for Solving Multiobjective Mathematical Programs (Q3343799):
Displayed 15 items.
- The compromise hypersphere for multiobjective linear programming (Q1869399) (← links)
- The double role of the weight factor in the goal programming model (Q1885954) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- D-STEM: a modified step method with desirability function concept (Q2387300) (← links)
- Parametric global optimisation for bilevel programming (Q2465486) (← links)
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (Q2564306) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- User acceptance of multi-criteria decision support systems: the impact of preference elicitation techniques (Q2569117) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698) (← links)
- Feature issue: Multiobjective programming and goal programming (Q5946139) (← links)
- Goal programming model: A glorious history and a promising future (Q5946140) (← links)