Pages that link to "Item:Q2655608"
From MaRDI portal
The following pages link to Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608):
Displaying 13 items.
- A hybrid evolutionary approach for set packing problem (Q260677) (← links)
- Multi-directional local search (Q339654) (← links)
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization (Q2427181) (← links)
- Multiobjective GRASP with path relinking (Q2629598) (← links)
- A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem (Q2867106) (← links)
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
- Analysis of baseline evolutionary algorithms for the packing while travelling problem (Q5215486) (← links)
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem (Q6070981) (← links)
