Pages that link to "Item:Q337035"

The following pages link to On finding representative non-dominated points for bi-objective integer network flow problems (Q337035):

Displaying 19 items.

• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
• Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
• Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level (Q2821098) (← links)
• Solving biobjective network flow problem associated with minimum cost-time loading (Q3389544) (← links)
• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
• Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)