Pages that link to "Item:Q2567886"
From MaRDI portal
The following pages link to Performance of the MOSA method for the bicriteria assignment problem (Q2567886):
Displaying 22 items.
- Cross entropy for multiobjective combinatorial optimization problems with linear relaxations (Q319096) (← links)
- Resource allocation in multi-class dynamic PERT networks with finite capacity (Q320114) (← links)
- An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
- Multi-start and path relinking methods to deal with multiobjective Knapsack problems (Q940855) (← links)
- Ant algorithms and simulated annealing for multicriteria dynamic programming (Q954043) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A bi-criteria approach for the data association problem (Q2379873) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- A multi-period machine assignment problem (Q2572247) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization (Q3627795) (← links)
- MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS (Q5036170) (← links)