Pages that link to "Item:Q2572861"

The following pages link to An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method (Q2572861):

Displaying 50 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• On the representation of the search region in multi-objective optimization (Q319674) (← links)
• Bi-objective multi-mode project scheduling under risk aversion (Q319785) (← links)
• The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience (Q320696) (← 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 math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← links)
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
• Multi-directional local search (Q339654) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farms (Q475228) (← 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)
• IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection (Q531474) (← 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)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• Equity portfolio construction and selection using multiobjective mathematical programming (Q975768) (← links)
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems (Q1029383) (← links)
• Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
• Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← 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)
• Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← links)
• A biobjective optimization model for deadline satisfaction in line-of-balance scheduling with work interruptions consideration (Q1721280) (← links)
• Multi-objective optimization using statistical models (Q1728516) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
• Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
• The bi-objective stochastic covering tour problem (Q1762147) (← links)
• Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years (Q1787914) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
• Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← 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)
• Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
• Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem (Q2030552) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• Bi-objective facility location under uncertainty with an application in last-mile disaster relief (Q2108809) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming (Q2157908) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)