Pages that link to "Item:Q2455615"

The following pages link to Two phase algorithms for the bi-objective assignment problem (Q2455615):

Displaying 38 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• On the representation of the search region in multi-objective optimization (Q319674) (← links)
• The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
• Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• On the multicriteria allocation problem (Q490242) (← links)
• An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
• Bi-objective matchings with the triangle inequality (Q515541) (← links)
• Win-win match using a genetic algorithm (Q611494) (← links)
• A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
• Multiobjective optimization for multimode transportation problems (Q721075) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
• A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
• Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
• A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
• Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
• A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← 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)
• Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
• Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
• An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm (Q3112556) (← links)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
• BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210) (← links)
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)
• Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)