Pages that link to "Item:Q4395807"
From MaRDI portal
The following pages link to Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization (Q4395807):
Displaying 50 items.
- The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
- Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
- Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics (Q324324) (← links)
- An exact solution approach for multi-objective location-transportation problem for disaster response (Q336763) (← links)
- Multi-directional local search (Q339654) (← links)
- A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- A local multiobjective optimization algorithm using neighborhood field (Q381903) (← links)
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
- Approximating the Pareto optimal set using a reduced set of objective functions (Q613484) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection (Q702713) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems (Q709108) (← links)
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection (Q819077) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- Hybrid methods in multi-criteria dynamic programming (Q850220) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Multi-objective optimization of mobile phone keymaps for typing messages using a word list (Q864000) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems (Q880496) (← links)
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem (Q883311) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16 (Q925782) (← links)
- Pareto memetic algorithm for multiple objective optimization with an industrial application (Q945051) (← links)
- A new multiobjective simulated annealing algorithm (Q946343) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems (Q953285) (← links)
- Ant algorithms and simulated annealing for multicriteria dynamic programming (Q954043) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models (Q983626) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Scheduling interfering job sets on parallel machines (Q1042099) (← links)
- Norm-based approximation in multicriteria programming. (Q1416300) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign (Q1652137) (← links)
- Many-objective Pareto local search (Q1653381) (← links)
- A triobjective model for locating a public semiobnoxious facility in the plane (Q1666194) (← links)
- A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA (Q1681133) (← links)
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
- Tour recommendation for groups (Q1741326) (← 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)
- Objective reduction for many-objective optimization problems using objective subspace extraction (Q1797785) (← links)
