Pages that link to "Item:Q4934175"

The following pages link to MOSA method: a tool for solving multiobjective combinatorial optimization problems (Q4934175):

Displaying 50 items.

• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
• Multi-directional local search (Q339654) (← links)
• Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• A survey of multidisciplinary design optimization methods in launch vehicle design (Q381758) (← links)
• Risk-pooling strategy, lead time, delivery reliability and inventory control decisions in a stochastic multi-objective supply chain network design (Q512963) (← links)
• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
• FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
• A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
• Planning efficient 4D trajectories in air traffic flow management. (Q666986) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• A tool for multiobjective evolutionary algorithms (Q834236) (← links)
• Hybrid methods in multi-criteria dynamic programming (Q850220) (← links)
• Bi-objective resource-constrained project scheduling with robustness and makespan criteria (Q850236) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems (Q857946) (← links)
• A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
• On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem (Q883311) (← links)
• A new multiobjective simulated annealing algorithm (Q946343) (← 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)
• Multi-criteria location planning for public facilities in tsunami-prone coastal areas (Q1027987) (← links)
• Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
• Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
• Norm-based approximation in multicriteria programming. (Q1416300) (← links)
• An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
• A bicriteria knapsack program for planning remediation of contaminated lightstation sites (Q1598774) (← links)
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates (Q1630186) (← links)
• A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
• GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization (Q1761114) (← links)
• A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network (Q1793287) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
• Service allocation equity in location coverage analytics (Q2083924) (← links)
• Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems (Q2178088) (← links)
• An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
• Negotiation mechanisms for the multi-agent multi-mode resource investment problem (Q2239866) (← links)
• Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
• A multiobjective metaheuristic for a mean-risk multistage capacity investment problem (Q2267821) (← links)
• Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
• Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics (Q2290779) (← links)
• Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
• Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Parallelization of population-based multi-objective meta-heuristics: an empirical study (Q2504445) (← links)
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)