Pages that link to "Item:Q339623"

The following pages link to An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623):

Displaying 20 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
• Bi-objective autonomous vehicle repositioning problem with travel time uncertainty (Q2026711) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← 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)
• A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
• Adaptive parametric scalarizations in multicriteria optimization (Q2875213) (← links)
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
• The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems (Q6614703) (← links)
• Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)