Pages that link to "Item:Q1160567"
From MaRDI portal
The following pages link to An algorithm for the multiple objective integer linear programming problem (Q1160567):
Displaying 50 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← links)
- An algorithm for the bi-criterion integer programming problem (Q1075952) (← links)
- A class of practical interactive branch and bound algorithms for multicriteria integer programming (Q1075953) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- Bicriteria network flow problems: Integer case (Q1207067) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan (Q1877048) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology (Q2009674) (← 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)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- Cutting plane method for multiple objective stochastic integer linear programming (Q2569084) (← 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)
- Bicriteria integer quadratic programming problems (Q2709837) (← links)
- Solving the Multiple Objective Integer Linear Programming Problem (Q3627676) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- (Q4945108) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Optimization of a linear function over an integer efficient set (Q6059580) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
