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 43 items.

• The bi-objective pollution-routing problem (Q2255967) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
• Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
• Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm (Q2290865) (← links)
• On efficiency of a single variable bi-objective optimization algorithm (Q2300650) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
• Interactive bicriterion decision support for a large scale industrial scheduling system (Q2347596) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks (Q2668762) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• Freshness-driven vehicle routing problem: modeling and application to the fresh agricultural product pick-storage-transportation (Q2691509) (← links)
• A multi-objective approach for designing a tire closed-loop supply chain network considering producer responsibility (Q2692103) (← links)
• A criterion space search algorithm for biobjective integer programming: the balanced box method (Q2802251) (← links)
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
• Bi-objective stochastic programming models for determining depot locations in disaster relief operations (Q2829153) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
• Outer Branching: How to Optimize under Partial Orders? (Q3649598) (← links)
• Multicriteria optimization approach to deploy humanitarian logistic operations integrally during floods (Q4571765) (← links)
• On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)
• Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics) (Q4929857) (← links)
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
• Activities planning and resources assignment on distinct places: a mathematical model (Q5247672) (← links)
• Stochastic multi-objective optimization: a survey on non-scalarizing methods (Q5963107) (← links)
• The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction (Q6056093) (← links)
• A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
• A new modeling approach for the biobjective exact optimization of satellite payload configuration (Q6087623) (← links)
• Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem (Q6106604) (← links)
• Robust generalized Merton-type financial portfolio models with generalized utility (Q6148775) (← links)
• Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors (Q6667690) (← links)