Pages that link to "Item:Q869006"
From MaRDI portal
The following pages link to Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006):
Displaying 12 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)