The following pages link to (Q4817408):
Displaying 29 items.
- Anytime Pareto local search (Q319099) (← links)
- The multi-objective generalized consistent vehicle routing problem (Q320011) (← links)
- Multi-directional local search (Q339654) (← 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)
- Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
- Lorenz dominance based algorithms to solve a practical multiobjective problem (Q1725590) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- A penalty-based multi-objectivization approach for single objective optimization (Q2198019) (← links)
- Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization (Q2669595) (← links)
- Multi-objective approaches for the open-pit mining operational planning problem (Q2840780) (← links)
- A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy (Q4608257) (← links)
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem (Q6063517) (← links)
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
