Pages that link to "Item:Q972646"
From MaRDI portal
The following pages link to Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646):
Displaying 24 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Anytime Pareto local search (Q319099) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments (Q1621406) (← links)
- A multi-objective green UAV routing problem (Q1651566) (← links)
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign (Q1652137) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- Many-objective Pareto local search (Q1653381) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
- Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND (Q2070137) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization (Q2669595) (← links)
- Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems (Q2815512) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- Tangency portfolios in the LP solvable portfolio selection models (Q3166274) (← links)
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem (Q6063517) (← links)
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
