Pages that link to "Item:Q274932"
From MaRDI portal
The following pages link to Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932):
Displaying 12 items.
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches (Q2108816) (← links)
- A constraint handling technique using compound distance for solving constrained multi-objective optimization problems (Q2133347) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm (Q6543093) (← links)
- How to know it is ``the one''? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization (Q6566828) (← links)
