Pages that link to "Item:Q1753507"

The following pages link to The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507):

Displaying 25 items.

• Planning efficient 4D trajectories in air traffic flow management. (Q666986) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
• Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
• Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← 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)
• A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
• A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
• An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) (← links)
• Optimising makespan and energy consumption in task scheduling for parallel systems (Q6164588) (← links)
• An exact criterion space search algorithm for a bi-objective blood collection problem (Q6168602) (← links)