Pages that link to "Item:Q4896386"

The following pages link to Multi‐objective combinatorial optimization problems: A survey (Q4896386):

Displaying 25 items.

• A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← 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)
• A survey of multi-objective sequential decision-making (Q2856473) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization (Q3305119) (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q3541795) (← links)
• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
• Solving the Multiple Objective Integer Linear Programming Problem (Q3627676) (← links)
• An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
• (Q4514764) (← links)
• (Q4666988) (← links)
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem (Q5084630) (← links)
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q5301134) (← links)
• Evolutionary Multi-Criterion Optimization (Q5709907) (← links)
• Genetic local search for multi-objective combinatorial optimization (Q5956204) (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• Optimal hierarchical clustering on a graph (Q6065857) (← links)
• A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
• Finding shortest and dissimilar paths (Q6071084) (← links)
• Combining discrete and continuous information for multi-criteria optimization problems (Q6616275) (← links)
• Approximating the shortest path problem with scenarios (Q6652474) (← links)