The following pages link to Andrzej Jaszkiewicz (Q230997):
Displaying 36 items.
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm (Q702718) (← links)
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
- (Q1038290) (redirect page) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Interactive analysis of multiple-criteria project scheduling problems (Q1296090) (← links)
- Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
- Improved quick hypervolume algorithm (Q1652507) (← links)
- Many-objective Pareto local search (Q1653381) (← links)
- Solving multiple criteria choice problems by interactive trichotomy segmentation (Q1807938) (← links)
- The ``Light Beam Search'' approach. -- An overview of methodology and applications (Q1807940) (← links)
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (Q1876139) (← links)
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization (Q2147143) (← links)
- Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
- Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- Pareto simulated annealing for fuzzy multi-objective combinatorial optimization (Q2567888) (← links)
- Metaheuristics in multiple objective optimization (Editorial) (Q2572857) (← links)
- (Q3070915) (← links)
- (Q3837766) (← links)
- (Q4296540) (← links)
- (Q4322787) (← links)
- (Q4363229) (← links)
- (Q4363233) (← links)
- Outranking-Based Interactive Exploration of a Set of Multicriteria Alternatives (Q4368578) (← links)
- (Q4387187) (← links)
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization (Q4395807) (← links)
- (Q4398248) (← links)
- (Q4433441) (← links)
- (Q4546411) (← links)
- (Q4789008) (← links)
- (Q4789027) (← links)
- (Q4817403) (← links)
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes (Q4863871) (← links)
- (Q4885619) (← links)
- (Q4944172) (← links)
- Genetic local search for multi-objective combinatorial optimization (Q5956204) (← links)
