Performance of the MOSA method for the bicriteria assignment problem
From MaRDI portal
Publication:2567886
DOI10.1023/A:1009670112978zbMath1071.90567OpenAlexW1559097468MaRDI QIDQ2567886
K. Van Nieuwenhuyze, Philippe Fortemps, Daniel Tuyttens, Jacques jun. Teghem
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009670112978
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem, Algorithm robust for the bicriteria discrete optimization problem, A bi-criteria approach for the data association problem, Cross entropy for multiobjective combinatorial optimization problems with linear relaxations, Resource allocation in multi-class dynamic PERT networks with finite capacity, Considering manufacturing cost and scheduling performance on a CNC turning machine, A population-based algorithm for solving linear assignment problems with two objectives, A multi-objective production scheduling case study solved by simulated annealing, A hybrid method for solving the multi-objective assignment problem, Two phase algorithms for the bi-objective assignment problem, Multi-start and path relinking methods to deal with multiobjective Knapsack problems, An interactive approach for biobjective integer programs under quasiconvex preference functions, Ant algorithms and simulated annealing for multicriteria dynamic programming, Using support vector machines to learn the efficient set in multiple objective discrete optimization, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization, An interactive heuristic method for multi-objective combinatorial optimization, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, A multi-period machine assignment problem
