Pages that link to "Item:Q1577993"

The following pages link to An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993):

Displaying 26 items.

• Graphical exploration of the weight space in three-objective mixed integer linear programs (Q320624) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
• Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling (Q1026787) (← links)
• The multiscenario lot size problem with concave costs. (Q1426700) (← links)
• A note on a decision support system for multiobjective integer and mixed-integer programming problems. (Q1428069) (← links)
• An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
• Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
• Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management (Q2384596) (← links)
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
• An integrated approach for stock evaluation and portfolio optimization (Q2903132) (← links)
• Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm (Q3225088) (← links)
• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
• Indifference sets of reference points in multi-objective integer linear programming (Q4329624) (← links)
• محاسبه مرز کارای مدل دوسطحی خطی چندهدفه (Q4615704) (← links)
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)