Pages that link to "Item:Q814696"

The following pages link to Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696):

Displaying 37 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
• An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems (Q1029383) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (Q1754103) (← links)
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
• Bi-objective optimisation over a set of convex sub-problems (Q2108798) (← links)
• Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← 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)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← 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)
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method (Q2802241) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming (Q5131728) (← links)
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
• A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method (Q5139845) (← links)
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
• An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) (← links)