Pages that link to "Item:Q2255968"

The following pages link to A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968):

Displaying 50 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• Robust optimization for the cyclic hoist scheduling problem (Q300031) (← links)
• On the representation of the search region in multi-objective optimization (Q319674) (← links)
• A multi-criteria approach for hospital capacity analysis (Q323555) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains (Q513645) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
• Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
• On nadir points of multiobjective integer programming problems (Q1683328) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• Weighted sum model with partial preference information: application to multi-objective optimization (Q1753485) (← links)
• Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← 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)
• On finding the optimal BDD relaxation (Q2011572) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program (Q2119757) (← links)
• Planning sustainable routes: economic, environmental and welfare concerns (Q2140143) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← 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)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
• A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← 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)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← 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)
• Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← links)
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← 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 computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966288) (← links)